/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:58:52,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:58:52,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:58:52,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:58:52,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:58:52,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:58:52,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:58:52,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:58:52,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:58:52,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:58:52,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:58:52,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:58:52,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:58:52,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:58:52,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:58:52,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:58:52,911 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:58:52,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:58:52,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:58:52,915 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:58:52,917 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:58:52,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:58:52,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:58:52,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:58:52,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:58:52,923 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:58:52,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:58:52,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:58:52,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:58:52,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:58:52,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:58:52,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:58:52,927 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:58:52,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:58:52,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:58:52,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:58:52,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:58:52,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:58:52,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:58:52,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:58:52,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:58:52,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:58:52,937 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:58:52,951 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:58:52,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:58:52,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:58:52,953 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:58:52,953 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:58:52,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:58:52,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:58:52,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:58:52,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:58:52,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:58:52,954 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:58:52,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:58:52,955 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:58:52,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:58:52,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:58:52,955 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:58:52,955 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:58:52,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:58:52,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:58:52,955 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:58:52,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:58:52,956 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:58:52,956 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:58:52,956 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:58:52,956 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:58:52,956 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 06:58:53,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:58:53,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:58:53,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:58:53,241 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:58:53,242 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:58:53,243 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt4.c [2022-04-15 06:58:53,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec5bb6ec1/abd5bc32a91f4005bdb53cd29af75a2b/FLAG977368082 [2022-04-15 06:58:53,768 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:58:53,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt4.c [2022-04-15 06:58:53,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec5bb6ec1/abd5bc32a91f4005bdb53cd29af75a2b/FLAG977368082 [2022-04-15 06:58:54,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec5bb6ec1/abd5bc32a91f4005bdb53cd29af75a2b [2022-04-15 06:58:54,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:58:54,178 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:58:54,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:58:54,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:58:54,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:58:54,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:58:54" (1/1) ... [2022-04-15 06:58:54,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761162f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:54, skipping insertion in model container [2022-04-15 06:58:54,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:58:54" (1/1) ... [2022-04-15 06:58:54,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:58:54,206 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:58:54,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt4.c[403,416] [2022-04-15 06:58:54,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:58:54,453 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:58:54,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt4.c[403,416] [2022-04-15 06:58:54,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:58:54,486 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:58:54,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:54 WrapperNode [2022-04-15 06:58:54,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:58:54,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:58:54,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:58:54,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:58:54,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:54" (1/1) ... [2022-04-15 06:58:54,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:54" (1/1) ... [2022-04-15 06:58:54,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:54" (1/1) ... [2022-04-15 06:58:54,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:54" (1/1) ... [2022-04-15 06:58:54,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:54" (1/1) ... [2022-04-15 06:58:54,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:54" (1/1) ... [2022-04-15 06:58:54,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:54" (1/1) ... [2022-04-15 06:58:54,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:58:54,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:58:54,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:58:54,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:58:54,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:54" (1/1) ... [2022-04-15 06:58:54,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:58:54,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:58:54,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 06:58:54,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 06:58:54,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:58:54,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:58:54,610 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:58:54,610 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 06:58:54,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:58:54,610 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:58:54,610 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:58:54,610 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:58:54,611 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:58:54,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:58:54,611 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 06:58:54,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:58:54,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 06:58:54,613 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:58:54,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:58:54,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:58:54,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:58:54,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:58:54,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:58:54,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:58:54,677 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:58:54,679 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:58:57,037 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:58:57,043 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:58:57,044 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 06:58:57,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:58:57 BoogieIcfgContainer [2022-04-15 06:58:57,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:58:57,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:58:57,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:58:57,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:58:57,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:58:54" (1/3) ... [2022-04-15 06:58:57,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f765ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:58:57, skipping insertion in model container [2022-04-15 06:58:57,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:58:54" (2/3) ... [2022-04-15 06:58:57,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f765ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:58:57, skipping insertion in model container [2022-04-15 06:58:57,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:58:57" (3/3) ... [2022-04-15 06:58:57,060 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt4.c [2022-04-15 06:58:57,066 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:58:57,066 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:58:57,156 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:58:57,165 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 06:58:57,165 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:58:57,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:58:57,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:58:57,188 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:58:57,189 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:57,189 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:57,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:57,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1709511738, now seen corresponding path program 1 times [2022-04-15 06:58:57,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:57,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1943002335] [2022-04-15 06:58:57,220 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:58:57,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1709511738, now seen corresponding path program 2 times [2022-04-15 06:58:57,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:57,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275117784] [2022-04-15 06:58:57,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:57,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:57,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:57,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {27#true} is VALID [2022-04-15 06:58:57,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 06:58:57,869 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #66#return; {27#true} is VALID [2022-04-15 06:58:57,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {35#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:57,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {27#true} is VALID [2022-04-15 06:58:57,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 06:58:57,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #66#return; {27#true} is VALID [2022-04-15 06:58:57,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2022-04-15 06:58:57,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 06:58:57,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 06:58:57,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 06:58:57,879 INFO L272 TraceCheckUtils]: 8: Hoare triple {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {33#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:58:57,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:58:57,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28#false} is VALID [2022-04-15 06:58:57,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 06:58:57,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:58:57,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:57,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275117784] [2022-04-15 06:58:57,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275117784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:57,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:57,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:58:57,889 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:57,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1943002335] [2022-04-15 06:58:57,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1943002335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:57,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:57,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:58:57,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833355661] [2022-04-15 06:58:57,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:57,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 06:58:57,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:57,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:57,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:57,923 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:58:57,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:57,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:58:57,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:58:57,950 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:02,522 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:59:04,679 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:59:06,848 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:59:07,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:07,387 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 06:59:07,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:59:07,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 06:59:07,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:59:07,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:07,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-15 06:59:07,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-15 06:59:07,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-15 06:59:07,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:07,497 INFO L225 Difference]: With dead ends: 51 [2022-04-15 06:59:07,497 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 06:59:07,500 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:59:07,504 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:59:07,505 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 41 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 6.6s Time] [2022-04-15 06:59:07,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 06:59:07,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 06:59:07,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:59:07,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:07,542 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:07,543 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:07,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:07,549 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-15 06:59:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 06:59:07,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:07,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:07,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 06:59:07,552 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 06:59:07,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:07,555 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-15 06:59:07,555 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 06:59:07,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:07,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:07,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:59:07,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:59:07,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:07,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-15 06:59:07,559 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2022-04-15 06:59:07,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:59:07,559 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-15 06:59:07,560 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:07,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-15 06:59:07,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:07,590 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 06:59:07,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:59:07,591 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:59:07,591 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:59:07,592 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:59:07,592 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:59:07,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:59:07,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1996045709, now seen corresponding path program 1 times [2022-04-15 06:59:07,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:07,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [180156592] [2022-04-15 06:59:08,682 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:08,685 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:59:08,687 INFO L85 PathProgramCache]: Analyzing trace with hash -46561988, now seen corresponding path program 1 times [2022-04-15 06:59:08,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:59:08,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106927247] [2022-04-15 06:59:08,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:08,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:59:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:09,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:59:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:09,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {234#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {224#true} is VALID [2022-04-15 06:59:09,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-15 06:59:09,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {224#true} {224#true} #66#return; {224#true} is VALID [2022-04-15 06:59:09,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {234#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:59:09,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {224#true} is VALID [2022-04-15 06:59:09,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-15 06:59:09,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #66#return; {224#true} is VALID [2022-04-15 06:59:09,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret5 := main(); {224#true} is VALID [2022-04-15 06:59:09,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {229#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 06:59:09,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {229#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {229#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 06:59:09,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [70] L21-2-->L21-3_primed: Formula: (let ((.cse0 (= v_main_~v4~0_7 v_main_~v4~0_6)) (.cse1 (= v_main_~l~0_15 v_main_~l~0_14)) (.cse3 (< (mod v_main_~l~0_15 4294967296) (mod v_main_~n~0_7 4294967296))) (.cse2 (= (mod v_main_~l~0_15 4) 0))) (or (and .cse0 .cse1 (= v_main_~n~0_7 v_main_~n~0_7)) (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (and (< v_main_~l~0_15 v_main_~l~0_14) .cse3 (< v_main_~l~0_14 (+ v_main_~l~0_15 2)) .cse2 (= (+ v_main_~l~0_15 v_main_~v4~0_6) (+ v_main_~l~0_14 v_main_~v4~0_7))))) InVars {main_~l~0=v_main_~l~0_15, main_~n~0=v_main_~n~0_7, main_~v4~0=v_main_~v4~0_7} OutVars{main_~l~0=v_main_~l~0_14, main_~n~0=v_main_~n~0_7, main_~v4~0=v_main_~v4~0_6} AuxVars[] AssignedVars[main_~l~0, main_~v4~0] {230#(and (= main_~k~0 0) (= main_~j~0 0) (or (and (or (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v4~0))) (or (and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1))) (not (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))))) (= main_~l~0 0)) (= main_~i~0 0) (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (not (= main_~l~0 0))))} is VALID [2022-04-15 06:59:09,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {230#(and (= main_~k~0 0) (= main_~j~0 0) (or (and (or (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v4~0))) (or (and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1))) (not (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))))) (= main_~l~0 0)) (= main_~i~0 0) (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (not (= main_~l~0 0))))} [69] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {231#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (or (= main_~l~0 0) (and (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)))) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:59:09,475 INFO L272 TraceCheckUtils]: 9: Hoare triple {231#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (or (= main_~l~0 0) (and (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)))) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {232#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:59:09,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {232#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {233#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:59:09,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {233#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {225#false} is VALID [2022-04-15 06:59:09,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-04-15 06:59:09,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:59:09,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:59:09,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106927247] [2022-04-15 06:59:09,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106927247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:09,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:09,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:59:09,922 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:59:09,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [180156592] [2022-04-15 06:59:09,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [180156592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:09,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:09,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:59:09,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888759234] [2022-04-15 06:59:09,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:59:09,924 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:59:09,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:59:09,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:09,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:09,946 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:59:09,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:09,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:59:09,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:59:09,947 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:12,576 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:59:12,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:12,879 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-15 06:59:12,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:59:12,879 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:59:12,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:59:12,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-04-15 06:59:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-04-15 06:59:12,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 45 transitions. [2022-04-15 06:59:12,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:12,936 INFO L225 Difference]: With dead ends: 36 [2022-04-15 06:59:12,936 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 06:59:12,936 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:59:12,938 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:59:12,938 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 43 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 85 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 06:59:12,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 06:59:12,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 06:59:12,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:59:12,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:12,950 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:12,950 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:12,952 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-15 06:59:12,952 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-15 06:59:12,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:12,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:12,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:59:12,953 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:59:12,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:12,955 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-15 06:59:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-15 06:59:12,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:12,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:12,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:59:12,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:59:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-15 06:59:12,957 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 15 [2022-04-15 06:59:12,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:59:12,958 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-15 06:59:12,958 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:12,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-15 06:59:12,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:12,990 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-15 06:59:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:59:12,991 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:59:12,991 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:59:12,991 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:59:12,991 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:59:12,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:59:12,992 INFO L85 PathProgramCache]: Analyzing trace with hash -376560181, now seen corresponding path program 1 times [2022-04-15 06:59:12,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:12,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1459773425] [2022-04-15 06:59:13,965 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:01:53,545 WARN L232 SmtUtils]: Spent 2.43m on a formula simplification. DAG size of input: 86 DAG size of output: 64 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-15 07:01:57,981 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:02:02,254 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:02:04,506 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-15 07:06:18,406 WARN L232 SmtUtils]: Spent 3.96m on a formula simplification. DAG size of input: 86 DAG size of output: 78 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-15 07:06:18,430 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:06:18,435 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:06:18,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1276973435, now seen corresponding path program 1 times [2022-04-15 07:06:18,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:06:18,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664444011] [2022-04-15 07:06:18,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:06:18,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:06:18,464 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 3 .aux_div_aux_mod_v_it_3_42_25.0) main_~j~0_5 (* 4294967296 .aux_div_v_it_3_42.2) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.1) (* (- 1) main_~l~0_7) (* (- 1) main_~j~0_9) 1) 0)) [2022-04-15 07:06:18,464 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 3) .aux_div_aux_mod_v_it_3_42_25.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.1) 4294967296) 0) [2022-04-15 07:06:18,464 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~l~0_7 (* (- 3) .aux_div_aux_mod_v_it_3_42_25.0) (* (- 4294967296) .aux_div_v_it_3_42.2) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.1) 1) 0)) [2022-04-15 07:06:18,464 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.1) 3) 0) [2022-04-15 07:06:18,464 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 3) .aux_div_aux_mod_v_it_3_42_25.0) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.1)) 0)) [2022-04-15 07:06:18,465 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.1) 0)) [2022-04-15 07:06:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:18,622 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 3 .aux_div_aux_mod_v_it_3_42_25.3) main_~j~0_5 (* 4294967296 .aux_div_v_it_3_42.5) (* 4294967296 .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) (* (- 1) main_~l~0_7) (* (- 1) main_~j~0_9) 1) 0)) [2022-04-15 07:06:18,622 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 3) .aux_div_aux_mod_v_it_3_42_25.3) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) 4294967296) 0) [2022-04-15 07:06:18,622 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~l~0_7 (* (- 3) .aux_div_aux_mod_v_it_3_42_25.3) (* (- 4294967296) .aux_div_v_it_3_42.5) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) 1) 0)) [2022-04-15 07:06:18,623 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) 3) 0) [2022-04-15 07:06:18,623 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 3) .aux_div_aux_mod_v_it_3_42_25.3) (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4)) 0)) [2022-04-15 07:06:18,623 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (* (- 4294967296) .aux_div_aux_mod_aux_mod_v_it_3_42_25_45.4) 0)) [2022-04-15 07:06:19,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:06:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:19,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {430#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {419#true} is VALID [2022-04-15 07:06:19,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {419#true} assume true; {419#true} is VALID [2022-04-15 07:06:19,134 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {419#true} {419#true} #66#return; {419#true} is VALID [2022-04-15 07:06:19,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {430#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:06:19,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {419#true} is VALID [2022-04-15 07:06:19,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2022-04-15 07:06:19,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #66#return; {419#true} is VALID [2022-04-15 07:06:19,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {419#true} call #t~ret5 := main(); {419#true} is VALID [2022-04-15 07:06:19,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {419#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {424#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 07:06:19,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {424#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {424#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 07:06:19,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {424#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [72] L21-2-->L21-3_primed: Formula: (let ((.cse0 (= v_main_~l~0_22 v_main_~l~0_21)) (.cse1 (= v_main_~v4~0_14 v_main_~v4~0_13)) (.cse3 (< (mod v_main_~l~0_22 4294967296) (mod v_main_~n~0_9 4294967296))) (.cse2 (= (mod v_main_~l~0_22 4) 0))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (and .cse0 (= v_main_~n~0_9 v_main_~n~0_9) .cse1) (and (= (+ v_main_~l~0_22 v_main_~v4~0_13) (+ v_main_~l~0_21 v_main_~v4~0_14)) (< v_main_~v4~0_14 v_main_~v4~0_13) (< v_main_~v4~0_13 (+ v_main_~v4~0_14 2)) .cse3 .cse2))) InVars {main_~l~0=v_main_~l~0_22, main_~n~0=v_main_~n~0_9, main_~v4~0=v_main_~v4~0_14} OutVars{main_~l~0=v_main_~l~0_21, main_~n~0=v_main_~n~0_9, main_~v4~0=v_main_~v4~0_13} AuxVars[] AssignedVars[main_~l~0, main_~v4~0] {425#(and (<= main_~l~0 main_~v4~0) (= main_~k~0 0) (= main_~j~0 0) (or (and (<= 1 main_~l~0) (<= main_~l~0 1)) (= main_~v4~0 0)) (= main_~i~0 0) (<= main_~v4~0 main_~l~0))} is VALID [2022-04-15 07:06:19,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {425#(and (<= main_~l~0 main_~v4~0) (= main_~k~0 0) (= main_~j~0 0) (or (and (<= 1 main_~l~0) (<= main_~l~0 1)) (= main_~v4~0 0)) (= main_~i~0 0) (<= main_~v4~0 main_~l~0))} [73] L21-3_primed-->L21-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#(and (<= main_~l~0 main_~v4~0) (= main_~k~0 0) (= main_~j~0 0) (or (and (<= 1 main_~l~0) (<= main_~l~0 1)) (= main_~v4~0 0)) (= main_~i~0 0) (<= main_~v4~0 main_~l~0))} is VALID [2022-04-15 07:06:19,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {425#(and (<= main_~l~0 main_~v4~0) (= main_~k~0 0) (= main_~j~0 0) (or (and (<= 1 main_~l~0) (<= main_~l~0 1)) (= main_~v4~0 0)) (= main_~i~0 0) (<= main_~v4~0 main_~l~0))} [74] L21-2-->L21-3_primed: Formula: (let ((.cse9 (mod v_main_~n~0_10 4294967296)) (.cse13 (mod v_main_~l~0_24 4294967296))) (let ((.cse2 (= (mod v_main_~l~0_24 2) 0)) (.cse10 (= (mod (mod .cse13 3) 4294967296) 0)) (.cse3 (< .cse13 .cse9)) (.cse4 (= (mod v_main_~l~0_24 4) 0)) (.cse11 (= v_main_~l~0_24 v_main_~l~0_23)) (.cse12 (= v_main_~j~0_7 v_main_~j~0_6))) (or (let ((.cse0 (* (- 1) v_main_~j~0_6)) (.cse1 (* v_main_~l~0_24 (- 1)))) (and (<= (div (+ v_main_~j~0_7 .cse0 .cse1 1) (- 2)) (+ (div (+ v_main_~l~0_24 (- 1)) 2) 1)) .cse2 .cse3 (not .cse4) (= (+ v_main_~l~0_23 v_main_~j~0_7) (+ v_main_~l~0_24 v_main_~j~0_6)) (< v_main_~j~0_7 v_main_~j~0_6) (forall ((aux_div_aux_mod_v_it_3_42_25 Int) (aux_div_aux_mod_aux_mod_v_it_3_42_25_45 Int) (aux_div_v_it_3_42 Int)) (let ((.cse5 (* 3 aux_div_aux_mod_v_it_3_42_25)) (.cse7 (* aux_div_aux_mod_aux_mod_v_it_3_42_25_45 4294967296))) (let ((.cse6 (* aux_div_v_it_3_42 4294967296)) (.cse8 (+ .cse5 .cse7))) (or (< (+ v_main_~l~0_24 v_main_~j~0_6) (+ .cse5 v_main_~j~0_7 .cse6 .cse7 1)) (<= 4294967296 .cse8) (< (+ .cse5 .cse6 .cse7) (+ v_main_~l~0_24 1)) (<= 3 .cse7) (< .cse8 0) (< .cse7 0))))) (< (div (+ v_main_~j~0_7 .cse0 .cse1) (- 4)) (+ 2 (div v_main_~l~0_24 4))) (<= (div (+ .cse9 v_main_~j~0_7 .cse0 .cse1) (- 4294967296)) (+ (div (+ v_main_~l~0_24 (- 4294967295)) 4294967296) 1)) (not .cse10))) (and .cse11 (or (not .cse2) .cse10 (not .cse3) .cse4) .cse12) (and .cse11 .cse12 (= v_main_~n~0_10 v_main_~n~0_10))))) InVars {main_~l~0=v_main_~l~0_24, main_~n~0=v_main_~n~0_10, main_~j~0=v_main_~j~0_7} OutVars{main_~l~0=v_main_~l~0_23, main_~n~0=v_main_~n~0_10, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~l~0, main_~j~0] {426#(and (= main_~k~0 0) (= main_~i~0 0) (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~j~0 main_~v4~0))) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)) (<= (+ main_~j~0 main_~v4~0) main_~l~0))} is VALID [2022-04-15 07:06:19,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {426#(and (= main_~k~0 0) (= main_~i~0 0) (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~j~0 main_~v4~0))) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)) (<= (+ main_~j~0 main_~v4~0) main_~l~0))} [71] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {427#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (= main_~k~0 0) (= main_~i~0 0) (<= (+ main_~j~0 main_~v4~0) (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)))} is VALID [2022-04-15 07:06:19,156 INFO L272 TraceCheckUtils]: 11: Hoare triple {427#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (= main_~k~0 0) (= main_~i~0 0) (<= (+ main_~j~0 main_~v4~0) (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {428#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:06:19,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {428#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {429#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:06:19,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {420#false} is VALID [2022-04-15 07:06:19,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {420#false} assume !false; {420#false} is VALID [2022-04-15 07:06:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:06:19,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:06:19,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664444011] [2022-04-15 07:06:19,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664444011] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:06:19,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512186746] [2022-04-15 07:06:19,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:06:19,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:06:19,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:06:19,167 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:06:19,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 07:06:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:19,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 07:06:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:19,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:07:03,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {419#true} is VALID [2022-04-15 07:07:03,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {419#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {419#true} is VALID [2022-04-15 07:07:03,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2022-04-15 07:07:03,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #66#return; {419#true} is VALID [2022-04-15 07:07:03,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {419#true} call #t~ret5 := main(); {419#true} is VALID [2022-04-15 07:07:03,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {419#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {424#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 07:07:03,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {424#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {424#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 07:07:03,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {424#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [72] L21-2-->L21-3_primed: Formula: (let ((.cse0 (= v_main_~l~0_22 v_main_~l~0_21)) (.cse1 (= v_main_~v4~0_14 v_main_~v4~0_13)) (.cse3 (< (mod v_main_~l~0_22 4294967296) (mod v_main_~n~0_9 4294967296))) (.cse2 (= (mod v_main_~l~0_22 4) 0))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (and .cse0 (= v_main_~n~0_9 v_main_~n~0_9) .cse1) (and (= (+ v_main_~l~0_22 v_main_~v4~0_13) (+ v_main_~l~0_21 v_main_~v4~0_14)) (< v_main_~v4~0_14 v_main_~v4~0_13) (< v_main_~v4~0_13 (+ v_main_~v4~0_14 2)) .cse3 .cse2))) InVars {main_~l~0=v_main_~l~0_22, main_~n~0=v_main_~n~0_9, main_~v4~0=v_main_~v4~0_14} OutVars{main_~l~0=v_main_~l~0_21, main_~n~0=v_main_~n~0_9, main_~v4~0=v_main_~v4~0_13} AuxVars[] AssignedVars[main_~l~0, main_~v4~0] {455#(and (= main_~k~0 0) (or (and (= main_~l~0 main_~v4~0) (< main_~v4~0 2) (< 0 main_~v4~0) (< 0 (mod main_~n~0 4294967296))) (and (= main_~l~0 0) (= main_~v4~0 0))) (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-15 07:07:03,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {455#(and (= main_~k~0 0) (or (and (= main_~l~0 main_~v4~0) (< main_~v4~0 2) (< 0 main_~v4~0) (< 0 (mod main_~n~0 4294967296))) (and (= main_~l~0 0) (= main_~v4~0 0))) (= main_~j~0 0) (= main_~i~0 0))} [73] L21-3_primed-->L21-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {455#(and (= main_~k~0 0) (or (and (= main_~l~0 main_~v4~0) (< main_~v4~0 2) (< 0 main_~v4~0) (< 0 (mod main_~n~0 4294967296))) (and (= main_~l~0 0) (= main_~v4~0 0))) (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-15 07:07:03,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {455#(and (= main_~k~0 0) (or (and (= main_~l~0 main_~v4~0) (< main_~v4~0 2) (< 0 main_~v4~0) (< 0 (mod main_~n~0 4294967296))) (and (= main_~l~0 0) (= main_~v4~0 0))) (= main_~j~0 0) (= main_~i~0 0))} [74] L21-2-->L21-3_primed: Formula: (let ((.cse9 (mod v_main_~n~0_10 4294967296)) (.cse13 (mod v_main_~l~0_24 4294967296))) (let ((.cse2 (= (mod v_main_~l~0_24 2) 0)) (.cse10 (= (mod (mod .cse13 3) 4294967296) 0)) (.cse3 (< .cse13 .cse9)) (.cse4 (= (mod v_main_~l~0_24 4) 0)) (.cse11 (= v_main_~l~0_24 v_main_~l~0_23)) (.cse12 (= v_main_~j~0_7 v_main_~j~0_6))) (or (let ((.cse0 (* (- 1) v_main_~j~0_6)) (.cse1 (* v_main_~l~0_24 (- 1)))) (and (<= (div (+ v_main_~j~0_7 .cse0 .cse1 1) (- 2)) (+ (div (+ v_main_~l~0_24 (- 1)) 2) 1)) .cse2 .cse3 (not .cse4) (= (+ v_main_~l~0_23 v_main_~j~0_7) (+ v_main_~l~0_24 v_main_~j~0_6)) (< v_main_~j~0_7 v_main_~j~0_6) (forall ((aux_div_aux_mod_v_it_3_42_25 Int) (aux_div_aux_mod_aux_mod_v_it_3_42_25_45 Int) (aux_div_v_it_3_42 Int)) (let ((.cse5 (* 3 aux_div_aux_mod_v_it_3_42_25)) (.cse7 (* aux_div_aux_mod_aux_mod_v_it_3_42_25_45 4294967296))) (let ((.cse6 (* aux_div_v_it_3_42 4294967296)) (.cse8 (+ .cse5 .cse7))) (or (< (+ v_main_~l~0_24 v_main_~j~0_6) (+ .cse5 v_main_~j~0_7 .cse6 .cse7 1)) (<= 4294967296 .cse8) (< (+ .cse5 .cse6 .cse7) (+ v_main_~l~0_24 1)) (<= 3 .cse7) (< .cse8 0) (< .cse7 0))))) (< (div (+ v_main_~j~0_7 .cse0 .cse1) (- 4)) (+ 2 (div v_main_~l~0_24 4))) (<= (div (+ .cse9 v_main_~j~0_7 .cse0 .cse1) (- 4294967296)) (+ (div (+ v_main_~l~0_24 (- 4294967295)) 4294967296) 1)) (not .cse10))) (and .cse11 (or (not .cse2) .cse10 (not .cse3) .cse4) .cse12) (and .cse11 .cse12 (= v_main_~n~0_10 v_main_~n~0_10))))) InVars {main_~l~0=v_main_~l~0_24, main_~n~0=v_main_~n~0_10, main_~j~0=v_main_~j~0_7} OutVars{main_~l~0=v_main_~l~0_23, main_~n~0=v_main_~n~0_10, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~l~0, main_~j~0] {425#(and (<= main_~l~0 main_~v4~0) (= main_~k~0 0) (= main_~j~0 0) (or (and (<= 1 main_~l~0) (<= main_~l~0 1)) (= main_~v4~0 0)) (= main_~i~0 0) (<= main_~v4~0 main_~l~0))} is VALID [2022-04-15 07:07:03,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {425#(and (<= main_~l~0 main_~v4~0) (= main_~k~0 0) (= main_~j~0 0) (or (and (<= 1 main_~l~0) (<= main_~l~0 1)) (= main_~v4~0 0)) (= main_~i~0 0) (<= main_~v4~0 main_~l~0))} [71] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {425#(and (<= main_~l~0 main_~v4~0) (= main_~k~0 0) (= main_~j~0 0) (or (and (<= 1 main_~l~0) (<= main_~l~0 1)) (= main_~v4~0 0)) (= main_~i~0 0) (<= main_~v4~0 main_~l~0))} is VALID [2022-04-15 07:07:03,484 INFO L272 TraceCheckUtils]: 11: Hoare triple {425#(and (<= main_~l~0 main_~v4~0) (= main_~k~0 0) (= main_~j~0 0) (or (and (<= 1 main_~l~0) (<= main_~l~0 1)) (= main_~v4~0 0)) (= main_~i~0 0) (<= main_~v4~0 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {468#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:07:03,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {468#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {472#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:07:03,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {472#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {420#false} is VALID [2022-04-15 07:07:03,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {420#false} assume !false; {420#false} is VALID [2022-04-15 07:07:03,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:07:03,485 INFO L328 TraceCheckSpWp]: Computing backward predicates...