/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/in-de31.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:36:12,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:36:12,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:36:12,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:36:12,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:36:12,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:36:12,325 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:36:12,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:36:12,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:36:12,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:36:12,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:36:12,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:36:12,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:36:12,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:36:12,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:36:12,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:36:12,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:36:12,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:36:12,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:36:12,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:36:12,351 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:36:12,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:36:12,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:36:12,354 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:36:12,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:36:12,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:36:12,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:36:12,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:36:12,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:36:12,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:36:12,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:36:12,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:36:12,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:36:12,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:36:12,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:36:12,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:36:12,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:36:12,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:36:12,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:36:12,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:36:12,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:36:12,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:36:12,371 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:36:12,381 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:36:12,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:36:12,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:36:12,382 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:36:12,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:36:12,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:36:12,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:36:12,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:36:12,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:36:12,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:36:12,384 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:36:12,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:36:12,384 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:36:12,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:36:12,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:36:12,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:36:12,385 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:36:12,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:36:12,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:36:12,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:36:12,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:36:12,386 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:36:12,386 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:36:12,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:36:12,386 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:36:12,386 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:36:12,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:36:12,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:36:12,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:36:12,632 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:36:12,632 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:36:12,633 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de31.c [2022-04-15 06:36:12,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64c18740d/24b81a69c9614ad69d291d243b384f8a/FLAG0efa612e2 [2022-04-15 06:36:13,053 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:36:13,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de31.c [2022-04-15 06:36:13,058 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64c18740d/24b81a69c9614ad69d291d243b384f8a/FLAG0efa612e2 [2022-04-15 06:36:13,071 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64c18740d/24b81a69c9614ad69d291d243b384f8a [2022-04-15 06:36:13,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:36:13,075 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:36:13,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:36:13,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:36:13,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:36:13,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:36:13" (1/1) ... [2022-04-15 06:36:13,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@182d1d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:13, skipping insertion in model container [2022-04-15 06:36:13,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:36:13" (1/1) ... [2022-04-15 06:36:13,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:36:13,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:36:13,287 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/in-de31.c[368,381] [2022-04-15 06:36:13,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:36:13,318 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:36:13,331 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/in-de31.c[368,381] [2022-04-15 06:36:13,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:36:13,356 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:36:13,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:13 WrapperNode [2022-04-15 06:36:13,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:36:13,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:36:13,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:36:13,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:36:13,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:13" (1/1) ... [2022-04-15 06:36:13,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:13" (1/1) ... [2022-04-15 06:36:13,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:13" (1/1) ... [2022-04-15 06:36:13,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:13" (1/1) ... [2022-04-15 06:36:13,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:13" (1/1) ... [2022-04-15 06:36:13,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:13" (1/1) ... [2022-04-15 06:36:13,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:13" (1/1) ... [2022-04-15 06:36:13,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:36:13,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:36:13,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:36:13,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:36:13,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:13" (1/1) ... [2022-04-15 06:36:13,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:36:13,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:36:13,425 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:36:13,434 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:36:13,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:36:13,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:36:13,463 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:36:13,464 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:36:13,464 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:36:13,464 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:36:13,464 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:36:13,464 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:36:13,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:36:13,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 06:36:13,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:36:13,464 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:36:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:36:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:36:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:36:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:36:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:36:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:36:13,512 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:36:13,513 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:36:13,739 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:36:13,744 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:36:13,744 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 06:36:13,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:36:13 BoogieIcfgContainer [2022-04-15 06:36:13,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:36:13,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:36:13,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:36:13,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:36:13,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:36:13" (1/3) ... [2022-04-15 06:36:13,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3407bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:36:13, skipping insertion in model container [2022-04-15 06:36:13,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:13" (2/3) ... [2022-04-15 06:36:13,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3407bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:36:13, skipping insertion in model container [2022-04-15 06:36:13,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:36:13" (3/3) ... [2022-04-15 06:36:13,764 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de31.c [2022-04-15 06:36:13,768 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:36:13,768 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:36:13,809 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:36:13,817 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:36:13,817 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:36:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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:36:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:36:13,842 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:36:13,842 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:36:13,842 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:36:13,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:36:13,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 1 times [2022-04-15 06:36:13,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:13,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [282950562] [2022-04-15 06:36:13,863 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:36:13,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 2 times [2022-04-15 06:36:13,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:36:13,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620982732] [2022-04-15 06:36:13,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:13,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:36:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:14,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:36:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:14,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-15 06:36:14,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 06:36:14,287 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-15 06:36:14,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:36:14,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-15 06:36:14,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 06:36:14,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-15 06:36:14,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret11 := main(); {25#true} is VALID [2022-04-15 06:36:14,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 06:36:14,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {31#(and (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)) (= main_~y~0 0))} is VALID [2022-04-15 06:36:14,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#(and (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)) (= main_~y~0 0))} ~z~0 := ~y~0; {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:36:14,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:36:14,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:36:14,297 INFO L272 TraceCheckUtils]: 10: Hoare triple {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:36:14,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:36:14,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26#false} is VALID [2022-04-15 06:36:14,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 06:36:14,300 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:36:14,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:36:14,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620982732] [2022-04-15 06:36:14,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620982732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:14,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:14,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:36:14,305 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:36:14,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [282950562] [2022-04-15 06:36:14,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [282950562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:14,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:14,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:36:14,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251237092] [2022-04-15 06:36:14,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:36:14,312 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 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 14 [2022-04-15 06:36:14,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:36:14,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 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:36:14,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:14,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:36:14,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:14,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:36:14,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:36:14,367 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 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:36:14,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:14,849 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2022-04-15 06:36:14,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:36:14,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 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 14 [2022-04-15 06:36:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:36:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 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:36:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-04-15 06:36:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 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:36:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-04-15 06:36:14,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 68 transitions. [2022-04-15 06:36:14,925 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:36:14,931 INFO L225 Difference]: With dead ends: 49 [2022-04-15 06:36:14,931 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 06:36:14,934 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:36:14,936 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:36:14,937 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 49 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:36:14,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 06:36:14,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 06:36:14,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:36:14,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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:36:14,961 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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:36:14,961 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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:36:14,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:14,963 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 06:36:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:36:14,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:14,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:14,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 16 states. [2022-04-15 06:36:14,964 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 16 states. [2022-04-15 06:36:14,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:14,966 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 06:36:14,966 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:36:14,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:14,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:14,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:36:14,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:36:14,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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:36:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-15 06:36:14,970 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2022-04-15 06:36:14,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:36:14,970 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-15 06:36:14,970 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 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:36:14,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-15 06:36:14,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:14,987 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:36:14,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:36:14,988 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:36:14,988 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:36:14,989 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:36:14,989 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:36:14,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:36:14,990 INFO L85 PathProgramCache]: Analyzing trace with hash 595464366, now seen corresponding path program 1 times [2022-04-15 06:36:14,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:14,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [165688269] [2022-04-15 06:36:15,545 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:36:15,551 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:36:15,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1152508211, now seen corresponding path program 1 times [2022-04-15 06:36:15,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:36:15,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110899181] [2022-04-15 06:36:15,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:15,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:36:15,582 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:36:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:15,629 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:36:15,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:36:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:15,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {225#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID [2022-04-15 06:36:15,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-15 06:36:15,931 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {212#true} {212#true} #61#return; {212#true} is VALID [2022-04-15 06:36:15,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:36:15,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID [2022-04-15 06:36:15,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-15 06:36:15,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #61#return; {212#true} is VALID [2022-04-15 06:36:15,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret11 := main(); {212#true} is VALID [2022-04-15 06:36:15,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {217#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 06:36:15,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {217#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} [65] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_8 v_main_~x~0_7)) (.cse1 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse2 (= v_main_~y~0_9 v_main_~y~0_8)) (.cse4 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse3 (mod v_main_~x~0_8 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (< 0 .cse3) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_8 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~y~0_9 v_it_1 1) v_main_~y~0_8)))) (< v_main_~y~0_9 v_main_~y~0_8) (= v_main_~x~0_7 (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_8 v_main_~y~0_9))))) InVars {main_~y~0=v_main_~y~0_9, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_8, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_7, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {218#(or (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) 1) (+ main_~y~0 main_~x~0)) (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:36:15,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#(or (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) 1) (+ main_~y~0 main_~x~0)) (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)))} [64] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {219#(or (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 06:36:15,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {219#(or (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} ~z~0 := ~y~0; {220#(or (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 06:36:15,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {220#(or (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {221#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 06:36:15,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {221#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} assume !(~y~0 % 4294967296 > 0); {222#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:36:15,950 INFO L272 TraceCheckUtils]: 11: Hoare triple {222#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {223#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:36:15,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {223#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {224#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:36:15,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {224#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {213#false} is VALID [2022-04-15 06:36:15,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-04-15 06:36:15,952 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:36:15,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:36:15,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110899181] [2022-04-15 06:36:15,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110899181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:15,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:15,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:36:16,338 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:36:16,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [165688269] [2022-04-15 06:36:16,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [165688269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:16,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:16,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:36:16,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135352160] [2022-04-15 06:36:16,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:36:16,339 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:36:16,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:36:16,340 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:36:16,385 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:36:16,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:36:16,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:16,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:36:16,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-15 06:36:16,387 INFO L87 Difference]: Start difference. First operand 16 states and 18 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:36:16,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:16,698 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 06:36:16,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:36:16,698 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:36:16,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:36:16,699 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:36:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-15 06:36:16,700 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:36:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-15 06:36:16,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2022-04-15 06:36:16,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:16,836 INFO L225 Difference]: With dead ends: 22 [2022-04-15 06:36:16,837 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 06:36:16,837 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-04-15 06:36:16,838 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:36:16,839 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 31 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 16 Unchecked, 0.1s Time] [2022-04-15 06:36:16,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 06:36:16,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 06:36:16,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:36:16,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:36:16,856 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:36:16,856 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:36:16,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:16,857 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 06:36:16,857 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:36:16,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:16,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:16,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 17 states. [2022-04-15 06:36:16,858 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 17 states. [2022-04-15 06:36:16,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:16,859 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 06:36:16,859 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:36:16,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:16,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:16,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:36:16,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:36:16,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:36:16,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 06:36:16,861 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2022-04-15 06:36:16,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:36:16,862 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 06:36:16,862 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:36:16,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 06:36:18,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:18,910 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:36:18,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:36:18,911 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:36:18,911 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:36:18,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:36:18,912 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:36:18,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:36:18,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1314021247, now seen corresponding path program 1 times [2022-04-15 06:36:18,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:18,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [87078384] [2022-04-15 06:36:19,486 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:36:19,488 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:36:19,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1046489728, now seen corresponding path program 1 times [2022-04-15 06:36:19,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:36:19,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366666659] [2022-04-15 06:36:19,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:19,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:36:19,508 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:36:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:19,542 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:36:19,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:36:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:19,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {359#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {352#true} is VALID [2022-04-15 06:36:19,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {352#true} assume true; {352#true} is VALID [2022-04-15 06:36:19,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {352#true} {352#true} #61#return; {352#true} is VALID [2022-04-15 06:36:19,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {352#true} call ULTIMATE.init(); {359#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:36:19,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {359#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {352#true} is VALID [2022-04-15 06:36:19,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {352#true} assume true; {352#true} is VALID [2022-04-15 06:36:19,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {352#true} {352#true} #61#return; {352#true} is VALID [2022-04-15 06:36:19,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {352#true} call #t~ret11 := main(); {352#true} is VALID [2022-04-15 06:36:19,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {352#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {352#true} is VALID [2022-04-15 06:36:19,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {352#true} [67] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_15 4294967296)) (.cse0 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse1 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse2 (= v_main_~x~0_15 v_main_~x~0_14)) (.cse4 (= v_main_~y~0_16 v_main_~y~0_15))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (= v_main_~y~0_15 (+ (* (- 1) v_main_~x~0_14) v_main_~x~0_15 v_main_~y~0_16)) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (< 0 (mod (+ v_main_~x~0_15 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_14 v_it_2 1) v_main_~x~0_15)))) (< v_main_~x~0_14 v_main_~x~0_15) (< 0 .cse3)) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_16, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_15, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_15, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_14, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {352#true} is VALID [2022-04-15 06:36:19,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {352#true} [66] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {352#true} is VALID [2022-04-15 06:36:19,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {352#true} ~z~0 := ~y~0; {357#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:36:19,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {357#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !(~z~0 % 4294967296 > 0); {358#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:36:19,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {358#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {353#false} is VALID [2022-04-15 06:36:19,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {353#false} assume !(~y~0 % 4294967296 > 0); {353#false} is VALID [2022-04-15 06:36:19,621 INFO L272 TraceCheckUtils]: 12: Hoare triple {353#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {353#false} is VALID [2022-04-15 06:36:19,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {353#false} ~cond := #in~cond; {353#false} is VALID [2022-04-15 06:36:19,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {353#false} assume 0 == ~cond; {353#false} is VALID [2022-04-15 06:36:19,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {353#false} assume !false; {353#false} is VALID [2022-04-15 06:36:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:36:19,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:36:19,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366666659] [2022-04-15 06:36:19,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366666659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:19,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:19,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:36:19,658 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:36:19,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [87078384] [2022-04-15 06:36:19,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [87078384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:19,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:19,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:36:19,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101617378] [2022-04-15 06:36:19,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:36:19,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 16 [2022-04-15 06:36:19,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:36:19,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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:36:19,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:19,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:36:19,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:19,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:36:19,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:36:19,674 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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:36:19,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:19,805 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 06:36:19,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:36:19,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 16 [2022-04-15 06:36:19,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:36:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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:36:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-15 06:36:19,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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:36:19,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-15 06:36:19,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-04-15 06:36:19,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:19,852 INFO L225 Difference]: With dead ends: 25 [2022-04-15 06:36:19,853 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 06:36:19,853 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:36:19,854 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:36:19,861 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:36:19,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 06:36:19,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 06:36:19,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:36:19,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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:36:19,881 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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:36:19,882 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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:36:19,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:19,888 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 06:36:19,888 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 06:36:19,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:19,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:19,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 18 states. [2022-04-15 06:36:19,891 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 18 states. [2022-04-15 06:36:19,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:19,892 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 06:36:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 06:36:19,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:19,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:19,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:36:19,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:36:19,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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:36:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-15 06:36:19,894 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2022-04-15 06:36:19,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:36:19,894 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-15 06:36:19,894 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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:36:19,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-15 06:36:19,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:20,000 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 06:36:20,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:36:20,000 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:36:20,000 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:36:20,000 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:36:20,001 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:36:20,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:36:20,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1642511809, now seen corresponding path program 1 times [2022-04-15 06:36:20,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:20,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1910659717] [2022-04-15 06:36:24,145 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:36:24,261 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:36:24,263 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:36:24,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1495870434, now seen corresponding path program 1 times [2022-04-15 06:36:24,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:36:24,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886789574] [2022-04-15 06:36:24,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:24,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:36:24,277 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:36:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:24,319 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:36:24,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:36:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:24,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {506#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {492#true} is VALID [2022-04-15 06:36:24,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#true} assume true; {492#true} is VALID [2022-04-15 06:36:24,669 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {492#true} {492#true} #61#return; {492#true} is VALID [2022-04-15 06:36:24,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {492#true} call ULTIMATE.init(); {506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:36:24,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {492#true} is VALID [2022-04-15 06:36:24,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {492#true} assume true; {492#true} is VALID [2022-04-15 06:36:24,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {492#true} {492#true} #61#return; {492#true} is VALID [2022-04-15 06:36:24,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {492#true} call #t~ret11 := main(); {492#true} is VALID [2022-04-15 06:36:24,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {492#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {497#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 06:36:24,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {497#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [69] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_22 4294967296)) (.cse0 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse2 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse3 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse4 (= v_main_~x~0_22 v_main_~x~0_21))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~x~0_22 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_21 v_it_3 1) v_main_~x~0_22)))) (< v_main_~x~0_21 v_main_~x~0_22) (= v_main_~y~0_23 (+ v_main_~x~0_22 v_main_~y~0_24 (* (- 1) v_main_~x~0_21))) (< 0 .cse1)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_22, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_21, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {498#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0)) (= main_~y~0 0))} is VALID [2022-04-15 06:36:24,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {498#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0)) (= main_~y~0 0))} [68] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {499#(or (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0)) (= main_~y~0 0))} is VALID [2022-04-15 06:36:24,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {499#(or (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0)) (= main_~y~0 0))} ~z~0 := ~y~0; {500#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0)) (= main_~y~0 0)))} is VALID [2022-04-15 06:36:24,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {500#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0)) (= main_~y~0 0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {501#(or (and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0) (= main_~y~0 0)) (and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div (+ (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-15 06:36:24,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {501#(or (and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0) (= main_~y~0 0)) (and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div (+ (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0)))} assume !(~z~0 % 4294967296 > 0); {502#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* 4294967296 (div (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296)) main_~z~0))} is VALID [2022-04-15 06:36:24,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* 4294967296 (div (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296)) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {503#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:36:24,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {503#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {503#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:36:24,686 INFO L272 TraceCheckUtils]: 13: Hoare triple {503#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {504#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:36:24,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {504#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {505#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:36:24,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {505#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {493#false} is VALID [2022-04-15 06:36:24,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {493#false} assume !false; {493#false} is VALID [2022-04-15 06:36:24,692 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 06:36:24,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:36:24,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886789574] [2022-04-15 06:36:24,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886789574] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:36:24,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723354446] [2022-04-15 06:36:24,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:24,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:36:24,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:36:24,699 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 06:36:24,731 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 06:36:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:24,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 06:36:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:25,665 INFO L286 TraceCheckSpWp]: Computing forward predicates...