/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/loop-lit/cggmp2005b.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:12:35,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:12:35,547 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:12:35,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:12:35,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:12:35,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:12:35,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:12:35,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:12:35,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:12:35,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:12:35,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:12:35,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:12:35,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:12:35,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:12:35,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:12:35,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:12:35,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:12:35,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:12:35,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:12:35,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:12:35,598 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:12:35,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:12:35,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:12:35,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:12:35,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:12:35,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:12:35,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:12:35,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:12:35,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:12:35,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:12:35,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:12:35,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:12:35,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:12:35,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:12:35,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:12:35,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:12:35,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:12:35,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:12:35,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:12:35,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:12:35,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:12:35,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:12:35,616 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:12:35,622 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:12:35,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:12:35,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:12:35,624 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:12:35,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:12:35,624 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:12:35,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:12:35,624 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:12:35,624 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:12:35,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:12:35,625 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:12:35,625 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:12:35,625 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:12:35,625 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:12:35,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:12:35,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:12:35,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:12:35,626 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:12:35,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:12:35,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:12:35,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:12:35,626 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:12:35,626 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:12:35,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:12:35,627 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:12:35,627 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:12:35,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:12:35,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:12:35,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:12:35,838 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:12:35,838 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:12:35,839 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005b.i [2022-04-15 06:12:35,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/847520428/41a22d1aacf5485285a7af6a17622813/FLAGc61dca7d4 [2022-04-15 06:12:36,265 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:12:36,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005b.i [2022-04-15 06:12:36,269 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/847520428/41a22d1aacf5485285a7af6a17622813/FLAGc61dca7d4 [2022-04-15 06:12:36,278 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/847520428/41a22d1aacf5485285a7af6a17622813 [2022-04-15 06:12:36,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:12:36,280 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:12:36,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:12:36,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:12:36,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:12:36,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:12:36" (1/1) ... [2022-04-15 06:12:36,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e25df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:36, skipping insertion in model container [2022-04-15 06:12:36,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:12:36" (1/1) ... [2022-04-15 06:12:36,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:12:36,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:12:36,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005b.i[895,908] [2022-04-15 06:12:36,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:12:36,435 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:12:36,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005b.i[895,908] [2022-04-15 06:12:36,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:12:36,455 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:12:36,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:36 WrapperNode [2022-04-15 06:12:36,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:12:36,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:12:36,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:12:36,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:12:36,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:36" (1/1) ... [2022-04-15 06:12:36,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:36" (1/1) ... [2022-04-15 06:12:36,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:36" (1/1) ... [2022-04-15 06:12:36,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:36" (1/1) ... [2022-04-15 06:12:36,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:36" (1/1) ... [2022-04-15 06:12:36,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:36" (1/1) ... [2022-04-15 06:12:36,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:36" (1/1) ... [2022-04-15 06:12:36,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:12:36,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:12:36,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:12:36,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:12:36,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:36" (1/1) ... [2022-04-15 06:12:36,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:12:36,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:12:36,507 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:12:36,509 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:12:36,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:12:36,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:12:36,530 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:12:36,530 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 06:12:36,531 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:12:36,531 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:12:36,531 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:12:36,531 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:12:36,531 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 06:12:36,531 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 06:12:36,531 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:12:36,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:12:36,531 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 06:12:36,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:12:36,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 06:12:36,531 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:12:36,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:12:36,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:12:36,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:12:36,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:12:36,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:12:36,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:12:36,573 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:12:36,575 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:12:36,670 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:12:36,675 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:12:36,675 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 06:12:36,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:12:36 BoogieIcfgContainer [2022-04-15 06:12:36,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:12:36,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:12:36,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:12:36,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:12:36,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:12:36" (1/3) ... [2022-04-15 06:12:36,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fe2be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:12:36, skipping insertion in model container [2022-04-15 06:12:36,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:36" (2/3) ... [2022-04-15 06:12:36,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fe2be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:12:36, skipping insertion in model container [2022-04-15 06:12:36,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:12:36" (3/3) ... [2022-04-15 06:12:36,685 INFO L111 eAbstractionObserver]: Analyzing ICFG cggmp2005b.i [2022-04-15 06:12:36,689 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:12:36,689 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:12:36,758 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:12:36,763 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:12:36,763 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:12:36,775 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:12:36,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 06:12:36,780 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:36,781 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:12:36,781 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:36,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:36,785 INFO L85 PathProgramCache]: Analyzing trace with hash -990540922, now seen corresponding path program 1 times [2022-04-15 06:12:36,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:36,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [583867754] [2022-04-15 06:12:36,800 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:36,800 INFO L85 PathProgramCache]: Analyzing trace with hash -990540922, now seen corresponding path program 2 times [2022-04-15 06:12:36,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:36,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757312674] [2022-04-15 06:12:36,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:36,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:36,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:36,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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(9, 2); {25#true} is VALID [2022-04-15 06:12:36,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 06:12:36,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #75#return; {25#true} is VALID [2022-04-15 06:12:36,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:12:36,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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(9, 2); {25#true} is VALID [2022-04-15 06:12:36,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 06:12:36,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #75#return; {25#true} is VALID [2022-04-15 06:12:36,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret1 := main(); {25#true} is VALID [2022-04-15 06:12:36,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {25#true} is VALID [2022-04-15 06:12:36,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-15 06:12:36,973 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {26#false} is VALID [2022-04-15 06:12:36,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-15 06:12:36,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-15 06:12:36,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 06:12:36,976 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:12:36,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:36,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757312674] [2022-04-15 06:12:36,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757312674] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:36,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:36,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:12:36,981 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:36,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [583867754] [2022-04-15 06:12:36,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [583867754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:36,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:36,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:12:36,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931460513] [2022-04-15 06:12:36,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:36,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 06:12:36,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:36,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:12:37,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:37,009 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:12:37,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:37,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:12:37,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:12:37,038 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:12:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:37,143 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2022-04-15 06:12:37,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:12:37,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 06:12:37,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:37,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:12:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-15 06:12:37,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:12:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-15 06:12:37,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2022-04-15 06:12:37,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:37,230 INFO L225 Difference]: With dead ends: 38 [2022-04-15 06:12:37,230 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 06:12:37,233 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:12:37,236 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:37,238 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:12:37,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 06:12:37,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 06:12:37,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:37,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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:12:37,265 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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:12:37,265 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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:12:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:37,267 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-15 06:12:37,267 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-15 06:12:37,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:37,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:37,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 15 states. [2022-04-15 06:12:37,268 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 15 states. [2022-04-15 06:12:37,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:37,269 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-15 06:12:37,269 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-15 06:12:37,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:37,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:37,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:37,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:37,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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:12:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-15 06:12:37,271 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-04-15 06:12:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:37,272 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-15 06:12:37,272 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:12:37,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 17 transitions. [2022-04-15 06:12:37,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:37,304 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-15 06:12:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 06:12:37,305 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:37,305 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:12:37,305 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:12:37,306 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:37,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:37,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1017323031, now seen corresponding path program 1 times [2022-04-15 06:12:37,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:37,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1364098017] [2022-04-15 06:12:37,307 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:37,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1017323031, now seen corresponding path program 2 times [2022-04-15 06:12:37,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:37,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940567626] [2022-04-15 06:12:37,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:37,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:37,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:37,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {175#(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(9, 2); {169#true} is VALID [2022-04-15 06:12:37,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-15 06:12:37,377 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {169#true} {169#true} #75#return; {169#true} is VALID [2022-04-15 06:12:37,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {169#true} call ULTIMATE.init(); {175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:12:37,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {175#(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(9, 2); {169#true} is VALID [2022-04-15 06:12:37,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-15 06:12:37,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} #75#return; {169#true} is VALID [2022-04-15 06:12:37,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} call #t~ret1 := main(); {169#true} is VALID [2022-04-15 06:12:37,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {174#(= main_~i~0 0)} is VALID [2022-04-15 06:12:37,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {174#(= main_~i~0 0)} assume !(~i~0 <= 100); {170#false} is VALID [2022-04-15 06:12:37,380 INFO L272 TraceCheckUtils]: 7: Hoare triple {170#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {170#false} is VALID [2022-04-15 06:12:37,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {170#false} ~cond := #in~cond; {170#false} is VALID [2022-04-15 06:12:37,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#false} assume 0 == ~cond; {170#false} is VALID [2022-04-15 06:12:37,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-04-15 06:12:37,381 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:12:37,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:37,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940567626] [2022-04-15 06:12:37,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940567626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:37,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:37,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:12:37,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:37,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1364098017] [2022-04-15 06:12:37,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1364098017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:37,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:37,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:12:37,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164244930] [2022-04-15 06:12:37,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:37,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-15 06:12:37,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:37,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:12:37,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:37,392 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:12:37,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:37,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:12:37,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:12:37,393 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:12:37,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:37,451 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 06:12:37,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:12:37,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-15 06:12:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:12:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-04-15 06:12:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:12:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-04-15 06:12:37,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 23 transitions. [2022-04-15 06:12:37,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:37,487 INFO L225 Difference]: With dead ends: 21 [2022-04-15 06:12:37,488 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 06:12:37,488 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:12:37,491 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:37,491 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 23 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:12:37,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 06:12:37,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 06:12:37,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:37,506 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:12:37,506 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:12:37,506 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:12:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:37,508 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 06:12:37,508 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:12:37,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:37,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:37,510 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:12:37,510 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:12:37,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:37,512 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 06:12:37,512 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:12:37,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:37,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:37,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:37,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:37,513 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:12:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-15 06:12:37,515 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2022-04-15 06:12:37,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:37,515 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-15 06:12:37,516 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:12:37,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-15 06:12:37,531 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:12:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:12:37,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:12:37,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:37,532 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:12:37,532 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:12:37,533 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:37,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:37,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1873832261, now seen corresponding path program 1 times [2022-04-15 06:12:37,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:37,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [252253894] [2022-04-15 06:12:41,740 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:12:41,856 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:12:41,858 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:12:41,860 INFO L85 PathProgramCache]: Analyzing trace with hash 165484666, now seen corresponding path program 1 times [2022-04-15 06:12:41,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:41,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757590660] [2022-04-15 06:12:41,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:41,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:41,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:41,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {293#(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(9, 2); {286#true} is VALID [2022-04-15 06:12:41,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#true} assume true; {286#true} is VALID [2022-04-15 06:12:41,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {286#true} {286#true} #75#return; {286#true} is VALID [2022-04-15 06:12:41,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {286#true} call ULTIMATE.init(); {293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:12:41,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#(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(9, 2); {286#true} is VALID [2022-04-15 06:12:41,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#true} assume true; {286#true} is VALID [2022-04-15 06:12:41,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {286#true} {286#true} #75#return; {286#true} is VALID [2022-04-15 06:12:41,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {286#true} call #t~ret1 := main(); {286#true} is VALID [2022-04-15 06:12:41,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {286#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {291#(and (= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:12:41,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {291#(and (= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [79] L35-3-->L29-2_primed: Formula: (let ((.cse0 (<= 20 v_main_~j~0_7)) (.cse1 (= v_main_~i~0_9 v_main_~i~0_8)) (.cse2 (= v_main_~k~0_11 v_main_~k~0_10))) (or (and (or (not (<= v_main_~i~0_9 100)) (not .cse0)) .cse1 .cse2) (and .cse0 (<= v_main_~i~0_8 101) (< v_main_~i~0_9 v_main_~i~0_8) (= v_main_~k~0_10 4)) (and (= v_main_~j~0_7 v_main_~j~0_7) .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_9, main_~k~0=v_main_~k~0_11, main_~j~0=v_main_~j~0_7} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_10, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {292#(= main_~i~0 0)} is VALID [2022-04-15 06:12:41,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {292#(= main_~i~0 0)} [78] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {287#false} is VALID [2022-04-15 06:12:41,934 INFO L272 TraceCheckUtils]: 8: Hoare triple {287#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {287#false} is VALID [2022-04-15 06:12:41,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {287#false} ~cond := #in~cond; {287#false} is VALID [2022-04-15 06:12:41,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {287#false} assume 0 == ~cond; {287#false} is VALID [2022-04-15 06:12:41,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-04-15 06:12:41,934 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:12:41,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:41,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757590660] [2022-04-15 06:12:41,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757590660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:41,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:41,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:12:41,970 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:41,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [252253894] [2022-04-15 06:12:41,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [252253894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:41,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:41,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:12:41,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336640193] [2022-04-15 06:12:41,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:41,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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:12:41,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:41,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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:12:41,983 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:12:41,983 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:12:41,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:41,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:12:41,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:12:41,984 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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:12:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:42,070 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-15 06:12:42,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 06:12:42,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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:12:42,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:42,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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:12:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 06:12:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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:12:42,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 06:12:42,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-15 06:12:42,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:42,100 INFO L225 Difference]: With dead ends: 26 [2022-04-15 06:12:42,100 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 06:12:42,100 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:12:42,102 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:42,102 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 27 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:12:42,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 06:12:42,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 06:12:42,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:42,106 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:12:42,107 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:12:42,107 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:12:42,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:42,108 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 06:12:42,108 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:12:42,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:42,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:42,108 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:12:42,108 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:12:42,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:42,109 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 06:12:42,109 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:12:42,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:42,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:42,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:42,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:42,110 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:12:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 06:12:42,110 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2022-04-15 06:12:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:42,111 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 06:12:42,111 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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:12:42,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 06:12:42,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:12:42,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:12:42,129 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:42,129 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:12:42,129 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:12:42,129 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:42,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:42,130 INFO L85 PathProgramCache]: Analyzing trace with hash -479695372, now seen corresponding path program 1 times [2022-04-15 06:12:42,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:42,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [68126317] [2022-04-15 06:12:45,778 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:12:50,023 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:12:57,492 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:12:57,782 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:12:58,636 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:12:58,646 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:12:58,650 INFO L85 PathProgramCache]: Analyzing trace with hash 224590010, now seen corresponding path program 1 times [2022-04-15 06:12:58,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:58,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255759313] [2022-04-15 06:12:58,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:58,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:58,672 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:12:58,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1886130228] [2022-04-15 06:12:58,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:58,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:12:58,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:12:58,675 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:12:58,676 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:12:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:58,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:12:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:58,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:12:59,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {421#true} call ULTIMATE.init(); {421#true} is VALID [2022-04-15 06:12:59,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {421#true} is VALID [2022-04-15 06:12:59,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {421#true} assume true; {421#true} is VALID [2022-04-15 06:12:59,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {421#true} {421#true} #75#return; {421#true} is VALID [2022-04-15 06:12:59,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {421#true} call #t~ret1 := main(); {421#true} is VALID [2022-04-15 06:12:59,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {421#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {441#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:12:59,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {441#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [81] L35-3-->L29-2_primed: Formula: (let ((.cse1 (<= v_main_~i~0_20 100)) (.cse0 (<= 19 (+ v_main_~i~0_20 v_main_~j~0_17))) (.cse2 (< v_main_~j~0_17 20)) (.cse3 (= v_main_~i~0_20 v_main_~i~0_19)) (.cse4 (= v_main_~k~0_16 v_main_~k~0_15)) (.cse5 (= v_main_~j~0_17 v_main_~j~0_16))) (or (and (or (not .cse0) (not .cse1) (not .cse2)) .cse3 .cse4 .cse5) (let ((.cse6 (div (+ v_main_~i~0_20 (* v_main_~i~0_19 (- 1)) 1) (- 2)))) (and (= v_main_~k~0_15 4) .cse1 (<= 0 .cse6) (= v_main_~j~0_16 (+ (* .cse6 3) v_main_~i~0_20 v_main_~j~0_17 (* 2 (* .cse6 .cse6)) (* (* v_main_~i~0_20 .cse6) 2) 1)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ v_main_~i~0_20 (* v_main_~i~0_19 (- 1)) 1) (- 2)))) (not (<= 0 v_itHalf_1)) (let ((.cse7 (* 2 (* v_itHalf_1 v_itHalf_1))) (.cse8 (* 2 (* v_main_~i~0_20 v_itHalf_1)))) (and (< (+ v_main_~i~0_20 v_main_~j~0_17 (* v_itHalf_1 3) .cse7 .cse8) 19) (<= 17 (+ v_main_~j~0_17 (* v_main_~i~0_20 2) (* v_itHalf_1 5) .cse7 .cse8)) (<= (+ v_main_~i~0_20 (* v_itHalf_1 2)) 99))))) .cse0 .cse2 (= (mod (+ v_main_~i~0_20 v_main_~i~0_19 1) 2) 0))) (and .cse3 .cse4 .cse5))) InVars {main_~i~0=v_main_~i~0_20, main_~k~0=v_main_~k~0_16, main_~j~0=v_main_~j~0_17} OutVars{main_~i~0=v_main_~i~0_19, main_~k~0=v_main_~k~0_15, main_~j~0=v_main_~j~0_16} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {445#(<= main_~i~0 0)} is VALID [2022-04-15 06:12:59,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {445#(<= main_~i~0 0)} [80] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {422#false} is VALID [2022-04-15 06:12:59,234 INFO L272 TraceCheckUtils]: 8: Hoare triple {422#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {422#false} is VALID [2022-04-15 06:12:59,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#false} ~cond := #in~cond; {422#false} is VALID [2022-04-15 06:12:59,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {422#false} assume 0 == ~cond; {422#false} is VALID [2022-04-15 06:12:59,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {422#false} assume !false; {422#false} is VALID [2022-04-15 06:12:59,234 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:12:59,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:12:59,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:59,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255759313] [2022-04-15 06:12:59,235 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:12:59,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886130228] [2022-04-15 06:12:59,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886130228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:59,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:59,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:12:59,377 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:59,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [68126317] [2022-04-15 06:12:59,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [68126317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:59,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:59,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:12:59,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553302271] [2022-04-15 06:12:59,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:59,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 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:12:59,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:59,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 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:12:59,400 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:12:59,401 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:12:59,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:59,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:12:59,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:12:59,402 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 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:12:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:59,482 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-15 06:12:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 06:12:59,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 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:12:59,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:59,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 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:12:59,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 06:12:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 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:12:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 06:12:59,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-15 06:12:59,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:59,511 INFO L225 Difference]: With dead ends: 27 [2022-04-15 06:12:59,511 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 06:12:59,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:12:59,515 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:59,516 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:12:59,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 06:12:59,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 06:12:59,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:59,526 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:12:59,526 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:12:59,527 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:12:59,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:59,528 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 06:12:59,528 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 06:12:59,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:59,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:59,530 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:12:59,530 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:12:59,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:59,531 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 06:12:59,532 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 06:12:59,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:59,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:59,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:59,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:59,533 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:12:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-15 06:12:59,536 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2022-04-15 06:12:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:59,537 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-15 06:12:59,537 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 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:12:59,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-15 06:12:59,554 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:12:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 06:12:59,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:12:59,557 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:59,557 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:12:59,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 06:12:59,774 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:12:59,774 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:59,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:59,775 INFO L85 PathProgramCache]: Analyzing trace with hash -211124773, now seen corresponding path program 2 times [2022-04-15 06:12:59,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:59,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2081926251] [2022-04-15 06:13:05,998 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:13:10,333 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:13:18,470 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:13:18,738 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:13:19,414 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:13:19,417 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:13:19,421 INFO L85 PathProgramCache]: Analyzing trace with hash 283695354, now seen corresponding path program 1 times [2022-04-15 06:13:19,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:19,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881154096] [2022-04-15 06:13:19,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:19,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:19,436 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:13:19,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [759295485] [2022-04-15 06:13:19,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:19,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:19,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:13:19,452 INFO L229 MonitoredProcess]: Starting monitored process 3 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:13:19,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 06:13:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:19,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:13:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:19,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:13:19,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {592#true} call ULTIMATE.init(); {592#true} is VALID [2022-04-15 06:13:19,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {592#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {592#true} is VALID [2022-04-15 06:13:19,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {592#true} assume true; {592#true} is VALID [2022-04-15 06:13:19,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {592#true} {592#true} #75#return; {592#true} is VALID [2022-04-15 06:13:19,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {592#true} call #t~ret1 := main(); {592#true} is VALID [2022-04-15 06:13:19,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {592#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {612#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:13:19,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {612#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [83] L35-3-->L29-2_primed: Formula: (let ((.cse1 (* v_main_~i~0_29 2))) (let ((.cse2 (<= v_main_~i~0_29 100)) (.cse3 (< (+ v_main_~i~0_29 v_main_~j~0_30) 19)) (.cse7 (<= 18 (+ v_main_~j~0_30 .cse1))) (.cse8 (= v_main_~i~0_29 v_main_~i~0_28)) (.cse9 (= v_main_~j~0_30 v_main_~j~0_28)) (.cse10 (= v_main_~k~0_20 v_main_~k~0_19))) (or (let ((.cse0 (div (+ v_main_~i~0_29 (* v_main_~i~0_28 (- 1)) 1) (- 2)))) (and (<= 0 .cse0) (= (mod (+ v_main_~i~0_29 v_main_~i~0_28 1) 2) 0) (= v_main_~j~0_28 (+ v_main_~j~0_30 (* .cse0 6) (* (* v_main_~i~0_29 .cse0) 4) 2 .cse1 (* (* .cse0 .cse0) 4))) .cse2 .cse3 (forall ((v_itHalf_2 Int)) (or (not (<= v_itHalf_2 (div (+ v_main_~i~0_29 (* v_main_~i~0_28 (- 1)) 1) (- 2)))) (not (<= 1 v_itHalf_2)) (let ((.cse4 (* v_itHalf_2 2)) (.cse5 (* (* v_main_~i~0_29 v_itHalf_2) 4)) (.cse6 (* (* v_itHalf_2 v_itHalf_2) 4))) (and (<= (+ v_main_~i~0_29 .cse4) 100) (< (+ v_main_~i~0_29 v_main_~j~0_30 (* v_itHalf_2 4) .cse5 .cse6) 19) (< (+ v_main_~j~0_30 .cse5 .cse4 .cse6) 20) (<= 18 (+ v_main_~j~0_30 .cse5 (* v_itHalf_2 6) (* v_main_~i~0_29 2) .cse6)))))) .cse7 (= v_main_~k~0_19 4))) (and .cse8 .cse9 .cse10 (or (not .cse2) (not .cse3) (not .cse7))) (and .cse8 .cse9 .cse10)))) InVars {main_~i~0=v_main_~i~0_29, main_~k~0=v_main_~k~0_20, main_~j~0=v_main_~j~0_30} OutVars{main_~i~0=v_main_~i~0_28, main_~k~0=v_main_~k~0_19, main_~j~0=v_main_~j~0_28} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {616#(<= main_~i~0 0)} is VALID [2022-04-15 06:13:19,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#(<= main_~i~0 0)} [82] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {593#false} is VALID [2022-04-15 06:13:19,819 INFO L272 TraceCheckUtils]: 8: Hoare triple {593#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {593#false} is VALID [2022-04-15 06:13:19,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {593#false} ~cond := #in~cond; {593#false} is VALID [2022-04-15 06:13:19,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {593#false} assume 0 == ~cond; {593#false} is VALID [2022-04-15 06:13:19,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {593#false} assume !false; {593#false} is VALID [2022-04-15 06:13:19,819 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:13:19,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:13:19,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:19,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881154096] [2022-04-15 06:13:19,820 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:13:19,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759295485] [2022-04-15 06:13:19,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759295485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:19,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:19,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:13:19,957 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:13:19,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2081926251] [2022-04-15 06:13:19,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2081926251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:19,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:19,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:13:19,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434452970] [2022-04-15 06:13:19,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:13:19,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 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 17 [2022-04-15 06:13:19,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:13:19,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 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:13:19,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:19,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:13:19,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:19,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:13:19,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:13:19,972 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 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:13:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:20,147 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-15 06:13:20,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:13:20,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 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 17 [2022-04-15 06:13:20,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:20,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 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:13:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-15 06:13:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 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:13:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-15 06:13:20,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-04-15 06:13:20,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:20,173 INFO L225 Difference]: With dead ends: 28 [2022-04-15 06:13:20,173 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 06:13:20,174 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:13:20,174 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:13:20,174 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:13:20,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 06:13:20,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 06:13:20,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:20,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:13:20,184 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:13:20,184 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:13:20,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:20,185 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 06:13:20,185 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 06:13:20,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:20,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:20,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 06:13:20,186 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 06:13:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:20,187 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 06:13:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 06:13:20,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:20,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:20,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:20,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:13:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 06:13:20,188 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 17 [2022-04-15 06:13:20,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:20,188 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 06:13:20,188 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 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:13:20,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-15 06:13:20,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 06:13:20,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 06:13:20,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:20,208 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:13:20,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 06:13:20,408 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:20,409 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:20,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:20,409 INFO L85 PathProgramCache]: Analyzing trace with hash -475370796, now seen corresponding path program 3 times [2022-04-15 06:13:20,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:20,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1107440705] [2022-04-15 06:13:22,477 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:13:26,652 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:13:32,810 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:13:33,037 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:13:33,846 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:13:33,850 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:13:33,855 INFO L85 PathProgramCache]: Analyzing trace with hash 342800698, now seen corresponding path program 1 times [2022-04-15 06:13:33,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:33,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774746844] [2022-04-15 06:13:33,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:33,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:33,863 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:13:33,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [105010989] [2022-04-15 06:13:33,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:33,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:33,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:13:33,865 INFO L229 MonitoredProcess]: Starting monitored process 4 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:13:33,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 06:13:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:33,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:13:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:33,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:13:34,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {772#true} call ULTIMATE.init(); {772#true} is VALID [2022-04-15 06:13:34,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {772#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {772#true} is VALID [2022-04-15 06:13:34,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#true} assume true; {772#true} is VALID [2022-04-15 06:13:34,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {772#true} {772#true} #75#return; {772#true} is VALID [2022-04-15 06:13:34,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {772#true} call #t~ret1 := main(); {772#true} is VALID [2022-04-15 06:13:34,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {772#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {792#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:13:34,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {792#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [85] L35-3-->L29-2_primed: Formula: (let ((.cse7 (* v_main_~i~0_38 3))) (let ((.cse0 (= v_main_~i~0_38 v_main_~i~0_37)) (.cse1 (= v_main_~k~0_24 v_main_~k~0_23)) (.cse6 (<= 17 (+ v_main_~j~0_45 .cse7))) (.cse9 (< (+ v_main_~j~0_45 (* v_main_~i~0_38 2)) 18)) (.cse8 (<= v_main_~i~0_38 100)) (.cse2 (= v_main_~j~0_45 v_main_~j~0_42))) (or (and .cse0 .cse1 .cse2) (let ((.cse5 (div (+ v_main_~i~0_38 (* v_main_~i~0_37 (- 1)) 1) (- 2)))) (and (= v_main_~k~0_23 4) (forall ((v_itHalf_3 Int)) (or (not (<= 1 v_itHalf_3)) (let ((.cse3 (* 6 (* v_itHalf_3 v_itHalf_3))) (.cse4 (* 6 (* v_main_~i~0_38 v_itHalf_3)))) (and (< (+ v_main_~i~0_38 v_main_~j~0_45 (* v_itHalf_3 5) .cse3 .cse4) 19) (< (+ v_main_~j~0_45 .cse3 .cse4 (* v_main_~i~0_38 2) (* 7 v_itHalf_3)) 18) (<= (+ v_main_~i~0_38 (* v_itHalf_3 2)) 100) (< (+ v_main_~j~0_45 .cse3 .cse4 (* v_itHalf_3 3)) 20) (<= 17 (+ v_main_~j~0_45 .cse3 .cse4 (* v_itHalf_3 9) (* v_main_~i~0_38 3))))) (not (<= v_itHalf_3 (div (+ v_main_~i~0_38 (* v_main_~i~0_37 (- 1)) 1) (- 2)))))) (<= 0 .cse5) .cse6 (= v_main_~j~0_42 (+ v_main_~j~0_45 (* .cse5 9) (* (* v_main_~i~0_38 .cse5) 6) 3 (* 6 (* .cse5 .cse5)) .cse7)) .cse8 (= (mod (+ v_main_~i~0_38 v_main_~i~0_37 1) 2) 0) .cse9)) (and .cse0 .cse1 (or (not .cse6) (not .cse9) (not .cse8)) .cse2)))) InVars {main_~i~0=v_main_~i~0_38, main_~k~0=v_main_~k~0_24, main_~j~0=v_main_~j~0_45} OutVars{main_~i~0=v_main_~i~0_37, main_~k~0=v_main_~k~0_23, main_~j~0=v_main_~j~0_42} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {796#(<= main_~i~0 0)} is VALID [2022-04-15 06:13:34,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {796#(<= main_~i~0 0)} [84] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {773#false} is VALID [2022-04-15 06:13:34,280 INFO L272 TraceCheckUtils]: 8: Hoare triple {773#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {773#false} is VALID [2022-04-15 06:13:34,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {773#false} ~cond := #in~cond; {773#false} is VALID [2022-04-15 06:13:34,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {773#false} assume 0 == ~cond; {773#false} is VALID [2022-04-15 06:13:34,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {773#false} assume !false; {773#false} is VALID [2022-04-15 06:13:34,281 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:13:34,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:13:34,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:34,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774746844] [2022-04-15 06:13:34,281 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:13:34,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105010989] [2022-04-15 06:13:34,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105010989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:34,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:34,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:13:34,451 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:13:34,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1107440705] [2022-04-15 06:13:34,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1107440705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:34,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:34,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:13:34,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112821581] [2022-04-15 06:13:34,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:13:34,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 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 18 [2022-04-15 06:13:34,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:13:34,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 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:13:34,464 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:13:34,465 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:13:34,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:34,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:13:34,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:13:34,465 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 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:13:34,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:34,598 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-15 06:13:34,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:13:34,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 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 18 [2022-04-15 06:13:34,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 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:13:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-15 06:13:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 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:13:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-15 06:13:34,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-15 06:13:34,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:34,623 INFO L225 Difference]: With dead ends: 29 [2022-04-15 06:13:34,623 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 06:13:34,623 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:13:34,624 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:13:34,624 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:13:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 06:13:34,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 06:13:34,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:34,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:34,634 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:34,634 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:34,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:34,635 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 06:13:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 06:13:34,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:34,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:34,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 06:13:34,635 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 06:13:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:34,638 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 06:13:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 06:13:34,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:34,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:34,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:34,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:13:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-15 06:13:34,647 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2022-04-15 06:13:34,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:34,648 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-15 06:13:34,648 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 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:13:34,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-15 06:13:34,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:34,667 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 06:13:34,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:13:34,667 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:34,667 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:13:34,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 06:13:34,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:34,883 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:34,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:34,884 INFO L85 PathProgramCache]: Analyzing trace with hash -77062917, now seen corresponding path program 4 times [2022-04-15 06:13:34,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:34,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [447288845] [2022-04-15 06:13:36,063 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:13:40,262 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:13:50,798 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:13:50,993 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:13:51,929 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:13:51,936 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:13:51,941 INFO L85 PathProgramCache]: Analyzing trace with hash 401906042, now seen corresponding path program 1 times [2022-04-15 06:13:51,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:13:51,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803870362] [2022-04-15 06:13:51,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:51,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:13:51,951 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:13:51,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [846234986] [2022-04-15 06:13:51,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:13:51,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:51,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:13:51,952 INFO L229 MonitoredProcess]: Starting monitored process 5 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:13:51,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 06:13:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:51,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:13:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:13:51,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:13:52,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {961#true} call ULTIMATE.init(); {961#true} is VALID [2022-04-15 06:13:52,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {961#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {961#true} is VALID [2022-04-15 06:13:52,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {961#true} assume true; {961#true} is VALID [2022-04-15 06:13:52,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {961#true} {961#true} #75#return; {961#true} is VALID [2022-04-15 06:13:52,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {961#true} call #t~ret1 := main(); {961#true} is VALID [2022-04-15 06:13:52,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {961#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {981#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:13:52,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {981#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [87] L35-3-->L29-2_primed: Formula: (let ((.cse2 (* v_main_~i~0_47 4))) (let ((.cse1 (<= v_main_~i~0_47 100)) (.cse0 (<= 16 (+ v_main_~j~0_62 .cse2))) (.cse4 (< (+ v_main_~j~0_62 (* v_main_~i~0_47 3)) 17)) (.cse7 (= v_main_~k~0_28 v_main_~k~0_27)) (.cse8 (= v_main_~i~0_47 v_main_~i~0_46))) (or (let ((.cse3 (div (+ v_main_~i~0_47 (* v_main_~i~0_46 (- 1)) 1) (- 2)))) (and .cse0 (= (mod (+ v_main_~i~0_47 v_main_~i~0_46 1) 2) 0) .cse1 (= v_main_~k~0_27 4) (= v_main_~j~0_58 (+ v_main_~j~0_62 .cse2 (* .cse3 12) (* (* .cse3 .cse3) 8) 4 (* (* v_main_~i~0_47 .cse3) 8))) .cse4 (<= 0 .cse3) (forall ((v_itHalf_4 Int)) (or (let ((.cse5 (* (* v_itHalf_4 v_itHalf_4) 8)) (.cse6 (* (* v_main_~i~0_47 v_itHalf_4) 8))) (and (< (+ v_main_~j~0_62 .cse5 (* v_main_~i~0_47 7) (* v_itHalf_4 18) .cse6) 10) (<= 8 (+ v_main_~j~0_62 (* v_itHalf_4 20) .cse5 (* v_main_~i~0_47 8) .cse6)) (< (+ (* v_itHalf_4 12) v_main_~j~0_62 .cse5 (* v_main_~i~0_47 4) .cse6) 16) (< (+ v_main_~j~0_62 (* v_itHalf_4 14) .cse5 (* v_main_~i~0_47 5) .cse6) 14) (< (+ v_main_~j~0_62 .cse5 .cse6 (* v_main_~i~0_47 6) (* v_itHalf_4 16)) 12) (<= (+ v_main_~i~0_47 (* v_itHalf_4 2)) 99))) (not (<= (+ v_itHalf_4 1) (div (+ v_main_~i~0_47 (* v_main_~i~0_46 (- 1)) 1) (- 2)))) (not (<= 0 v_itHalf_4)))))) (and (= v_main_~j~0_58 v_main_~j~0_62) .cse7 .cse8 (or (not .cse1) (not .cse0) (not .cse4))) (and .cse7 .cse8 (= v_main_~j~0_62 v_main_~j~0_58))))) InVars {main_~i~0=v_main_~i~0_47, main_~k~0=v_main_~k~0_28, main_~j~0=v_main_~j~0_62} OutVars{main_~i~0=v_main_~i~0_46, main_~k~0=v_main_~k~0_27, main_~j~0=v_main_~j~0_58} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {985#(<= main_~i~0 0)} is VALID [2022-04-15 06:13:52,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {985#(<= main_~i~0 0)} [86] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {962#false} is VALID [2022-04-15 06:13:52,413 INFO L272 TraceCheckUtils]: 8: Hoare triple {962#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {962#false} is VALID [2022-04-15 06:13:52,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {962#false} ~cond := #in~cond; {962#false} is VALID [2022-04-15 06:13:52,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {962#false} assume 0 == ~cond; {962#false} is VALID [2022-04-15 06:13:52,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {962#false} assume !false; {962#false} is VALID [2022-04-15 06:13:52,413 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:13:52,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:13:52,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:13:52,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803870362] [2022-04-15 06:13:52,413 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:13:52,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846234986] [2022-04-15 06:13:52,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846234986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:52,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:52,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:13:52,580 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:13:52,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [447288845] [2022-04-15 06:13:52,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [447288845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:13:52,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:13:52,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:13:52,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751448500] [2022-04-15 06:13:52,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:13:52,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 19 [2022-04-15 06:13:52,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:13:52,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 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:13:52,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:52,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:13:52,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:52,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:13:52,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:13:52,596 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 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:13:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:52,773 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-15 06:13:52,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:13:52,773 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 19 [2022-04-15 06:13:52,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:13:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 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:13:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-15 06:13:52,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 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:13:52,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-15 06:13:52,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-15 06:13:52,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:52,802 INFO L225 Difference]: With dead ends: 30 [2022-04-15 06:13:52,802 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 06:13:52,802 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:13:52,803 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:13:52,803 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:13:52,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 06:13:52,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 06:13:52,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:13:52,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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:13:52,820 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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:13:52,820 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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:13:52,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:52,821 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 06:13:52,821 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 06:13:52,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:52,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:52,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 21 states. [2022-04-15 06:13:52,822 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 21 states. [2022-04-15 06:13:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:13:52,822 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 06:13:52,822 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 06:13:52,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:13:52,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:13:52,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:13:52,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:13:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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:13:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-15 06:13:52,824 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2022-04-15 06:13:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:13:52,824 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-15 06:13:52,824 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 2 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:13:52,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-15 06:13:52,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:13:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 06:13:52,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:13:52,844 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:13:52,844 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:13:52,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 06:13:53,051 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:13:53,052 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:13:53,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:13:53,052 INFO L85 PathProgramCache]: Analyzing trace with hash -614420556, now seen corresponding path program 5 times [2022-04-15 06:13:53,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:13:53,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [70618733] [2022-04-15 06:13:56,877 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:14:01,117 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:14:04,175 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:14:04,399 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:14:05,453 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:14:05,457 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:14:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash 461011386, now seen corresponding path program 1 times [2022-04-15 06:14:05,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:05,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672810809] [2022-04-15 06:14:05,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:05,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:05,485 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:14:05,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1256737709] [2022-04-15 06:14:05,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:05,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:05,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:05,486 INFO L229 MonitoredProcess]: Starting monitored process 6 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:14:05,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 06:14:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:05,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:14:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:05,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:05,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {1159#true} call ULTIMATE.init(); {1159#true} is VALID [2022-04-15 06:14:05,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {1159#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1159#true} is VALID [2022-04-15 06:14:05,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {1159#true} assume true; {1159#true} is VALID [2022-04-15 06:14:05,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1159#true} {1159#true} #75#return; {1159#true} is VALID [2022-04-15 06:14:05,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {1159#true} call #t~ret1 := main(); {1159#true} is VALID [2022-04-15 06:14:05,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {1159#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {1179#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:14:05,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {1179#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [89] L35-3-->L29-2_primed: Formula: (let ((.cse8 (* v_main_~i~0_56 5))) (let ((.cse0 (= v_main_~k~0_32 v_main_~k~0_31)) (.cse1 (= v_main_~i~0_56 v_main_~i~0_55)) (.cse2 (<= v_main_~i~0_56 100)) (.cse3 (<= 15 (+ v_main_~j~0_81 .cse8))) (.cse4 (< (+ v_main_~j~0_81 (* v_main_~i~0_56 4)) 16))) (or (and .cse0 .cse1 (= v_main_~j~0_81 v_main_~j~0_76)) (and (= v_main_~j~0_76 v_main_~j~0_81) .cse0 .cse1 (or (not .cse2) (not .cse3) (not .cse4))) (let ((.cse5 (div (+ v_main_~i~0_56 (* v_main_~i~0_55 (- 1)) 1) (- 2)))) (and (<= 0 .cse5) (forall ((v_itHalf_5 Int)) (or (let ((.cse6 (* (* v_main_~i~0_56 v_itHalf_5) 10)) (.cse7 (* 10 (* v_itHalf_5 v_itHalf_5)))) (and (< (+ v_main_~j~0_81 (* v_main_~i~0_56 8) .cse6 .cse7 (* v_itHalf_5 21)) 9) (< (+ v_main_~j~0_81 (* 19 v_itHalf_5) .cse6 (* v_main_~i~0_56 7) .cse7) 11) (<= (+ v_main_~i~0_56 (* v_itHalf_5 2)) 99) (< (+ v_main_~j~0_81 (* v_itHalf_5 15) .cse6 .cse7 (* v_main_~i~0_56 5)) 15) (< (+ v_main_~j~0_81 (* 23 v_itHalf_5) .cse6 .cse7 (* v_main_~i~0_56 9)) 7) (< (+ v_main_~j~0_81 .cse6 .cse7 (* v_itHalf_5 17) (* v_main_~i~0_56 6)) 13) (<= 5 (+ v_main_~j~0_81 .cse6 .cse7 (* v_main_~i~0_56 10) (* v_itHalf_5 25))))) (not (<= (+ v_itHalf_5 1) (div (+ v_main_~i~0_56 (* v_main_~i~0_55 (- 1)) 1) (- 2)))) (not (<= 0 v_itHalf_5)))) .cse2 (= (mod (+ v_main_~i~0_56 v_main_~i~0_55 1) 2) 0) .cse3 (= v_main_~j~0_76 (+ v_main_~j~0_81 5 (* (* v_main_~i~0_56 .cse5) 10) (* 10 (* .cse5 .cse5)) .cse8 (* .cse5 15))) .cse4 (= v_main_~k~0_31 4)))))) InVars {main_~i~0=v_main_~i~0_56, main_~k~0=v_main_~k~0_32, main_~j~0=v_main_~j~0_81} OutVars{main_~i~0=v_main_~i~0_55, main_~k~0=v_main_~k~0_31, main_~j~0=v_main_~j~0_76} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {1183#(<= main_~i~0 0)} is VALID [2022-04-15 06:14:05,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {1183#(<= main_~i~0 0)} [88] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {1160#false} is VALID [2022-04-15 06:14:05,881 INFO L272 TraceCheckUtils]: 8: Hoare triple {1160#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1160#false} is VALID [2022-04-15 06:14:05,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#false} ~cond := #in~cond; {1160#false} is VALID [2022-04-15 06:14:05,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {1160#false} assume 0 == ~cond; {1160#false} is VALID [2022-04-15 06:14:05,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {1160#false} assume !false; {1160#false} is VALID [2022-04-15 06:14:05,882 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:14:05,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:14:05,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:05,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672810809] [2022-04-15 06:14:05,882 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:14:05,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256737709] [2022-04-15 06:14:05,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256737709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:05,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:05,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:14:06,059 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:06,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [70618733] [2022-04-15 06:14:06,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [70618733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:06,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:06,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:14:06,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477889760] [2022-04-15 06:14:06,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:06,060 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 2 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 20 [2022-04-15 06:14:06,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:06,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 2 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:14:06,075 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:14:06,075 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:14:06,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:06,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:14:06,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:14:06,076 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 2 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:14:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:06,293 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-15 06:14:06,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:14:06,293 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 2 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 20 [2022-04-15 06:14:06,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 2 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:14:06,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-15 06:14:06,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 2 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:14:06,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-15 06:14:06,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2022-04-15 06:14:06,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:06,349 INFO L225 Difference]: With dead ends: 31 [2022-04-15 06:14:06,350 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 06:14:06,350 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-04-15 06:14:06,350 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:06,350 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:14:06,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 06:14:06,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-15 06:14:06,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:06,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:14:06,371 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:14:06,371 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:14:06,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:06,372 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 06:14:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 06:14:06,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:06,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:06,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 22 states. [2022-04-15 06:14:06,372 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 22 states. [2022-04-15 06:14:06,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:06,373 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 06:14:06,373 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 06:14:06,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:06,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:06,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:06,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:14:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-04-15 06:14:06,374 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2022-04-15 06:14:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:06,374 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-04-15 06:14:06,374 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 2 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:14:06,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 24 transitions. [2022-04-15 06:14:06,395 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:14:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 06:14:06,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 06:14:06,396 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:06,396 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:06,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 06:14:06,597 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:06,597 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:06,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:06,598 INFO L85 PathProgramCache]: Analyzing trace with hash -92638181, now seen corresponding path program 6 times [2022-04-15 06:14:06,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:06,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1599926062] [2022-04-15 06:14:11,374 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:14:15,591 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:14:21,959 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:14:22,184 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:14:23,228 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:14:23,233 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:14:23,245 INFO L85 PathProgramCache]: Analyzing trace with hash 520116730, now seen corresponding path program 1 times [2022-04-15 06:14:23,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:23,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854888960] [2022-04-15 06:14:23,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:23,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:23,265 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:14:23,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1724115844] [2022-04-15 06:14:23,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:23,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:23,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:23,266 INFO L229 MonitoredProcess]: Starting monitored process 7 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:14:23,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 06:14:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:23,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:14:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:23,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:23,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1366#true} is VALID [2022-04-15 06:14:23,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {1366#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1366#true} is VALID [2022-04-15 06:14:23,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2022-04-15 06:14:23,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #75#return; {1366#true} is VALID [2022-04-15 06:14:23,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret1 := main(); {1366#true} is VALID [2022-04-15 06:14:23,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {1366#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {1386#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:14:23,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {1386#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [91] L35-3-->L29-2_primed: Formula: (let ((.cse4 (* v_main_~i~0_65 6))) (let ((.cse7 (= v_main_~k~0_36 v_main_~k~0_35)) (.cse8 (= v_main_~i~0_65 v_main_~i~0_64)) (.cse6 (<= 14 (+ v_main_~j~0_102 .cse4))) (.cse0 (<= v_main_~i~0_65 100)) (.cse5 (< (+ v_main_~j~0_102 (* v_main_~i~0_65 5)) 15))) (or (let ((.cse3 (div (+ v_main_~i~0_65 (* v_main_~i~0_64 (- 1)) 1) (- 2)))) (and .cse0 (forall ((v_itHalf_6 Int)) (or (let ((.cse1 (* 12 (* v_itHalf_6 v_itHalf_6))) (.cse2 (* (* v_main_~i~0_65 v_itHalf_6) 12))) (and (< (+ (* v_itHalf_6 20) .cse1 v_main_~j~0_102 (* v_main_~i~0_65 7) .cse2) 12) (<= (+ v_main_~i~0_65 (* v_itHalf_6 2)) 99) (< (+ .cse1 v_main_~j~0_102 (* v_itHalf_6 18) (* v_main_~i~0_65 6) .cse2) 14) (<= 2 (+ .cse1 (* v_itHalf_6 30) v_main_~j~0_102 (* v_main_~i~0_65 12) .cse2)) (< (+ .cse1 v_main_~j~0_102 (* v_main_~i~0_65 10) (* v_itHalf_6 26) .cse2) 6) (< (+ (* v_main_~i~0_65 8) .cse1 v_main_~j~0_102 .cse2 (* v_itHalf_6 22)) 10) (< (+ .cse1 (* v_itHalf_6 24) v_main_~j~0_102 (* v_main_~i~0_65 9) .cse2) 8) (< (+ .cse1 v_main_~j~0_102 (* v_itHalf_6 28) .cse2 (* v_main_~i~0_65 11)) 4))) (not (<= (+ v_itHalf_6 1) (div (+ v_main_~i~0_65 (* v_main_~i~0_64 (- 1)) 1) (- 2)))) (not (<= 0 v_itHalf_6)))) (= (mod (+ v_main_~i~0_65 v_main_~i~0_64 1) 2) 0) (= v_main_~k~0_35 4) (= v_main_~j~0_96 (+ v_main_~j~0_102 (* (* v_main_~i~0_65 .cse3) 12) 6 (* (* .cse3 .cse3) 12) .cse4 (* .cse3 18))) (<= 0 .cse3) .cse5 .cse6)) (and (= v_main_~j~0_102 v_main_~j~0_96) .cse7 .cse8) (and (= v_main_~j~0_96 v_main_~j~0_102) .cse7 .cse8 (or (not .cse6) (not .cse0) (not .cse5)))))) InVars {main_~i~0=v_main_~i~0_65, main_~k~0=v_main_~k~0_36, main_~j~0=v_main_~j~0_102} OutVars{main_~i~0=v_main_~i~0_64, main_~k~0=v_main_~k~0_35, main_~j~0=v_main_~j~0_96} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {1390#(<= main_~i~0 0)} is VALID [2022-04-15 06:14:23,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {1390#(<= main_~i~0 0)} [90] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {1367#false} is VALID [2022-04-15 06:14:23,728 INFO L272 TraceCheckUtils]: 8: Hoare triple {1367#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1367#false} is VALID [2022-04-15 06:14:23,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2022-04-15 06:14:23,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2022-04-15 06:14:23,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2022-04-15 06:14:23,728 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:14:23,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:14:23,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:23,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854888960] [2022-04-15 06:14:23,728 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:14:23,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724115844] [2022-04-15 06:14:23,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724115844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:23,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:23,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:14:23,977 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:23,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1599926062] [2022-04-15 06:14:23,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1599926062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:23,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:23,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:14:23,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566212336] [2022-04-15 06:14:23,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:23,978 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 2 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 21 [2022-04-15 06:14:23,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:23,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 2 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:14:23,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:23,999 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:14:23,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:24,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:14:24,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:14:24,000 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 2 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:14:24,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:24,293 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-15 06:14:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:14:24,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 2 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 21 [2022-04-15 06:14:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 2 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:14:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-15 06:14:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 2 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:14:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-15 06:14:24,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 37 transitions. [2022-04-15 06:14:24,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:24,324 INFO L225 Difference]: With dead ends: 32 [2022-04-15 06:14:24,324 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 06:14:24,324 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2022-04-15 06:14:24,325 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:24,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:14:24,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 06:14:24,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 06:14:24,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:24,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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:14:24,351 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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:14:24,351 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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:14:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:24,351 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 06:14:24,352 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 06:14:24,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:24,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:24,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:14:24,352 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:14:24,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:24,353 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 06:14:24,353 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 06:14:24,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:24,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:24,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:24,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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:14:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-15 06:14:24,354 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21 [2022-04-15 06:14:24,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:24,354 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-15 06:14:24,354 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 2 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:14:24,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-15 06:14:24,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 06:14:24,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 06:14:24,389 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:24,389 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:24,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 06:14:24,591 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:24,592 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:24,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:24,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1097253740, now seen corresponding path program 7 times [2022-04-15 06:14:24,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:24,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [895108989] [2022-04-15 06:14:31,054 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:14:35,273 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:14:39,648 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:14:39,876 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:14:41,028 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:14:41,032 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:14:41,038 INFO L85 PathProgramCache]: Analyzing trace with hash 579222074, now seen corresponding path program 1 times [2022-04-15 06:14:41,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:41,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140634116] [2022-04-15 06:14:41,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:41,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:41,048 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:14:41,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1608286771] [2022-04-15 06:14:41,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:41,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:41,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:41,049 INFO L229 MonitoredProcess]: Starting monitored process 8 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:14:41,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 06:14:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:41,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:14:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:41,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:41,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {1582#true} call ULTIMATE.init(); {1582#true} is VALID [2022-04-15 06:14:41,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {1582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1582#true} is VALID [2022-04-15 06:14:41,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {1582#true} assume true; {1582#true} is VALID [2022-04-15 06:14:41,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1582#true} {1582#true} #75#return; {1582#true} is VALID [2022-04-15 06:14:41,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {1582#true} call #t~ret1 := main(); {1582#true} is VALID [2022-04-15 06:14:41,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {1582#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {1602#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:14:41,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {1602#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [93] L35-3-->L29-2_primed: Formula: (let ((.cse8 (* v_main_~i~0_74 7))) (let ((.cse4 (<= 13 (+ v_main_~j~0_125 .cse8))) (.cse3 (< (+ v_main_~j~0_125 (* v_main_~i~0_74 6)) 14)) (.cse2 (<= v_main_~i~0_74 100)) (.cse0 (= v_main_~j~0_125 v_main_~j~0_118)) (.cse1 (= v_main_~i~0_74 v_main_~i~0_73))) (or (and .cse0 (= v_main_~k~0_39 v_main_~k~0_40) .cse1 (or (not .cse2) (not .cse3) (not .cse4))) (let ((.cse7 (div (+ v_main_~i~0_74 (* v_main_~i~0_73 (- 1)) 1) (- 2)))) (and .cse4 .cse3 (= (mod (+ v_main_~i~0_74 v_main_~i~0_73 1) 2) 0) (forall ((v_itHalf_7 Int)) (or (not (<= v_itHalf_7 (div (+ v_main_~i~0_74 (* v_main_~i~0_73 (- 1)) 1) (- 2)))) (not (<= 1 v_itHalf_7)) (let ((.cse5 (* 14 (* v_itHalf_7 v_itHalf_7))) (.cse6 (* 14 (* v_main_~i~0_74 v_itHalf_7)))) (and (< (+ v_main_~j~0_125 .cse5 .cse6 (* v_itHalf_7 11) (* v_main_~i~0_74 2)) 18) (< (+ v_main_~j~0_125 .cse5 (* v_main_~i~0_74 6) .cse6 (* 19 v_itHalf_7)) 14) (<= (+ v_main_~i~0_74 (* v_itHalf_7 2)) 100) (< (+ v_main_~i~0_74 v_main_~j~0_125 .cse5 .cse6 (* v_itHalf_7 9)) 19) (< (+ (* v_main_~i~0_74 5) v_main_~j~0_125 .cse5 .cse6 (* v_itHalf_7 17)) 15) (< (+ (* v_itHalf_7 15) v_main_~j~0_125 .cse5 (* v_main_~i~0_74 4) .cse6) 16) (< (+ v_main_~j~0_125 .cse5 .cse6 (* 7 v_itHalf_7)) 20) (< (+ v_main_~j~0_125 .cse5 .cse6 (* v_itHalf_7 13) (* v_main_~i~0_74 3)) 17) (<= 13 (+ v_main_~j~0_125 (* v_main_~i~0_74 7) .cse5 (* v_itHalf_7 21) .cse6)))))) (= v_main_~k~0_39 4) (= (+ v_main_~j~0_125 (* 14 (* v_main_~i~0_74 .cse7)) 7 .cse8 (* .cse7 21) (* (* .cse7 .cse7) 14)) v_main_~j~0_118) .cse2 (<= 0 .cse7))) (and .cse0 .cse1 (= v_main_~k~0_40 v_main_~k~0_39))))) InVars {main_~i~0=v_main_~i~0_74, main_~k~0=v_main_~k~0_40, main_~j~0=v_main_~j~0_125} OutVars{main_~i~0=v_main_~i~0_73, main_~k~0=v_main_~k~0_39, main_~j~0=v_main_~j~0_118} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {1606#(<= main_~i~0 0)} is VALID [2022-04-15 06:14:41,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {1606#(<= main_~i~0 0)} [92] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {1583#false} is VALID [2022-04-15 06:14:41,494 INFO L272 TraceCheckUtils]: 8: Hoare triple {1583#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1583#false} is VALID [2022-04-15 06:14:41,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {1583#false} ~cond := #in~cond; {1583#false} is VALID [2022-04-15 06:14:41,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {1583#false} assume 0 == ~cond; {1583#false} is VALID [2022-04-15 06:14:41,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {1583#false} assume !false; {1583#false} is VALID [2022-04-15 06:14:41,494 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:14:41,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:14:41,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:41,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140634116] [2022-04-15 06:14:41,495 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:14:41,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608286771] [2022-04-15 06:14:41,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608286771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:41,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:41,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:14:41,713 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:41,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [895108989] [2022-04-15 06:14:41,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [895108989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:41,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:41,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:14:41,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522223559] [2022-04-15 06:14:41,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:41,715 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 2 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 22 [2022-04-15 06:14:41,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:41,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 2 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:14:41,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:41,729 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:14:41,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:41,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:14:41,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:14:41,730 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 2 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:14:42,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:42,056 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-15 06:14:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 06:14:42,056 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 2 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 22 [2022-04-15 06:14:42,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 2 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:14:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2022-04-15 06:14:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 2 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:14:42,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2022-04-15 06:14:42,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 38 transitions. [2022-04-15 06:14:42,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:42,082 INFO L225 Difference]: With dead ends: 33 [2022-04-15 06:14:42,082 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 06:14:42,083 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:14:42,083 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:42,083 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:14:42,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 06:14:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 06:14:42,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:42,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:42,110 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:42,111 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:42,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:42,111 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 06:14:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 06:14:42,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:42,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:42,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 06:14:42,112 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 06:14:42,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:42,112 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 06:14:42,112 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 06:14:42,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:42,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:42,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:42,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-15 06:14:42,113 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 22 [2022-04-15 06:14:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:42,113 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-15 06:14:42,113 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 2 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:14:42,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-15 06:14:42,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 06:14:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:14:42,137 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:42,137 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:42,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-15 06:14:42,338 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:42,338 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:42,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:42,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2119402299, now seen corresponding path program 8 times [2022-04-15 06:14:42,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:42,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1665261876] [2022-04-15 06:14:49,307 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:14:53,554 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:15:00,768 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:15:01,000 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:02,414 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:02,420 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:15:02,426 INFO L85 PathProgramCache]: Analyzing trace with hash 638327418, now seen corresponding path program 1 times [2022-04-15 06:15:02,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:02,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424902193] [2022-04-15 06:15:02,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:02,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:02,436 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:15:02,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [950910404] [2022-04-15 06:15:02,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:02,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:02,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:02,437 INFO L229 MonitoredProcess]: Starting monitored process 9 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:15:02,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 06:15:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:02,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:15:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:02,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:02,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {1807#true} call ULTIMATE.init(); {1807#true} is VALID [2022-04-15 06:15:02,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {1807#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1807#true} is VALID [2022-04-15 06:15:02,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-15 06:15:02,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1807#true} {1807#true} #75#return; {1807#true} is VALID [2022-04-15 06:15:02,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {1807#true} call #t~ret1 := main(); {1807#true} is VALID [2022-04-15 06:15:02,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {1807#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {1827#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:15:02,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {1827#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [95] L35-3-->L29-2_primed: Formula: (let ((.cse8 (* v_main_~i~0_83 8))) (let ((.cse0 (= v_main_~k~0_44 v_main_~k~0_43)) (.cse3 (<= v_main_~i~0_83 100)) (.cse2 (< (+ v_main_~j~0_150 (* v_main_~i~0_83 7)) 13)) (.cse6 (<= 12 (+ v_main_~j~0_150 .cse8))) (.cse1 (= v_main_~i~0_83 v_main_~i~0_82))) (or (and .cse0 .cse1 (= v_main_~j~0_150 v_main_~j~0_142)) (let ((.cse7 (div (+ v_main_~i~0_83 (* v_main_~i~0_82 (- 1)) 1) (- 2)))) (and .cse2 .cse3 (forall ((v_itHalf_8 Int)) (or (not (<= 0 v_itHalf_8)) (let ((.cse4 (* (* v_main_~i~0_83 v_itHalf_8) 16)) (.cse5 (* 16 (* v_itHalf_8 v_itHalf_8)))) (and (<= 0 (+ (* v_main_~i~0_83 16) (* 40 v_itHalf_8) v_main_~j~0_150 .cse4 .cse5 4)) (< (+ v_main_~j~0_150 .cse4 (* v_itHalf_8 36) .cse5 (* v_main_~i~0_83 14)) 0) (< (+ v_main_~j~0_150 .cse4 .cse5 (* v_itHalf_8 34) (* v_main_~i~0_83 13)) 2) (< (+ v_main_~j~0_150 .cse4 (* v_itHalf_8 38) 2 .cse5 (* v_main_~i~0_83 15)) 0) (< (+ v_main_~j~0_150 .cse4 .cse5 (* v_main_~i~0_83 9) (* v_itHalf_8 26)) 10) (< (+ v_main_~j~0_150 .cse4 .cse5 (* v_itHalf_8 30) (* v_main_~i~0_83 11)) 6) (< (+ (* v_itHalf_8 28) (* v_main_~i~0_83 10) v_main_~j~0_150 .cse4 .cse5) 8) (< (+ v_main_~j~0_150 .cse4 .cse5 (* v_itHalf_8 24) (* v_main_~i~0_83 8)) 12) (< (+ (* v_main_~i~0_83 12) v_main_~j~0_150 .cse4 .cse5 (* v_itHalf_8 32)) 4) (<= (+ v_main_~i~0_83 (* v_itHalf_8 2)) 99))) (not (<= (+ v_itHalf_8 1) (div (+ v_main_~i~0_83 (* v_main_~i~0_82 (- 1)) 1) (- 2)))))) .cse6 (<= 0 .cse7) (= v_main_~k~0_43 4) (= (mod (+ v_main_~i~0_83 v_main_~i~0_82 1) 2) 0) (= (+ (* 16 (* v_main_~i~0_83 .cse7)) v_main_~j~0_150 (* (* .cse7 .cse7) 16) 8 (* .cse7 24) .cse8) v_main_~j~0_142))) (and (= v_main_~j~0_142 v_main_~j~0_150) .cse0 (or (not .cse3) (not .cse2) (not .cse6)) .cse1)))) InVars {main_~i~0=v_main_~i~0_83, main_~k~0=v_main_~k~0_44, main_~j~0=v_main_~j~0_150} OutVars{main_~i~0=v_main_~i~0_82, main_~k~0=v_main_~k~0_43, main_~j~0=v_main_~j~0_142} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {1831#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:02,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {1831#(<= main_~i~0 0)} [94] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {1808#false} is VALID [2022-04-15 06:15:02,922 INFO L272 TraceCheckUtils]: 8: Hoare triple {1808#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1808#false} is VALID [2022-04-15 06:15:02,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {1808#false} ~cond := #in~cond; {1808#false} is VALID [2022-04-15 06:15:02,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {1808#false} assume 0 == ~cond; {1808#false} is VALID [2022-04-15 06:15:02,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {1808#false} assume !false; {1808#false} is VALID [2022-04-15 06:15:02,922 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:15:02,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:15:02,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:02,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424902193] [2022-04-15 06:15:02,922 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:15:02,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950910404] [2022-04-15 06:15:02,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950910404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:02,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:02,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:15:03,193 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:03,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1665261876] [2022-04-15 06:15:03,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1665261876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:03,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:03,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:15:03,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437440162] [2022-04-15 06:15:03,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:03,194 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 2 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 23 [2022-04-15 06:15:03,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:03,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 2 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:15:03,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:03,213 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:15:03,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:03,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:15:03,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-04-15 06:15:03,214 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 2 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:15:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:03,594 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-15 06:15:03,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:15:03,595 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 2 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 23 [2022-04-15 06:15:03,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 2 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:15:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 39 transitions. [2022-04-15 06:15:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 2 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:15:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 39 transitions. [2022-04-15 06:15:03,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 39 transitions. [2022-04-15 06:15:03,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:03,623 INFO L225 Difference]: With dead ends: 34 [2022-04-15 06:15:03,623 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 06:15:03,624 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:15:03,624 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:03,624 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:15:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 06:15:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 06:15:03,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:03,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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:15:03,654 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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:15:03,654 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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:15:03,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:03,655 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 06:15:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 06:15:03,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:03,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:03,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 25 states. [2022-04-15 06:15:03,655 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 25 states. [2022-04-15 06:15:03,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:03,656 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 06:15:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 06:15:03,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:03,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:03,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:03,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:03,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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:15:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-15 06:15:03,657 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2022-04-15 06:15:03,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:03,657 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-15 06:15:03,657 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 2 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:15:03,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-15 06:15:03,685 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:15:03,685 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 06:15:03,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 06:15:03,686 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:03,686 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:03,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 06:15:03,888 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 06:15:03,889 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:03,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:03,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1243475596, now seen corresponding path program 9 times [2022-04-15 06:15:03,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:03,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [65270313] [2022-04-15 06:15:10,491 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:15:14,713 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:15:22,365 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:15:22,544 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:23,913 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:23,919 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:15:23,927 INFO L85 PathProgramCache]: Analyzing trace with hash 697432762, now seen corresponding path program 1 times [2022-04-15 06:15:23,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:23,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369649445] [2022-04-15 06:15:23,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:23,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:23,941 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:15:23,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1463754083] [2022-04-15 06:15:23,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:23,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:23,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:23,943 INFO L229 MonitoredProcess]: Starting monitored process 10 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:15:23,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 06:15:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:23,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:15:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:24,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:24,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {2041#true} call ULTIMATE.init(); {2041#true} is VALID [2022-04-15 06:15:24,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {2041#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2041#true} is VALID [2022-04-15 06:15:24,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {2041#true} assume true; {2041#true} is VALID [2022-04-15 06:15:24,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2041#true} {2041#true} #75#return; {2041#true} is VALID [2022-04-15 06:15:24,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {2041#true} call #t~ret1 := main(); {2041#true} is VALID [2022-04-15 06:15:24,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {2041#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {2061#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:15:24,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {2061#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [97] L35-3-->L29-2_primed: Formula: (let ((.cse8 (* v_main_~i~0_92 9))) (let ((.cse0 (= v_main_~k~0_48 v_main_~k~0_47)) (.cse1 (= v_main_~i~0_92 v_main_~i~0_91)) (.cse4 (<= 11 (+ v_main_~j~0_177 .cse8))) (.cse3 (< (+ v_main_~j~0_177 (* v_main_~i~0_92 8)) 12)) (.cse2 (<= v_main_~i~0_92 100))) (or (and .cse0 .cse1 (= v_main_~j~0_177 v_main_~j~0_168)) (and .cse0 (or (not .cse2) (not .cse3) (not .cse4)) .cse1 (= v_main_~j~0_168 v_main_~j~0_177)) (let ((.cse5 (div (+ v_main_~i~0_92 (* v_main_~i~0_91 (- 1)) 1) (- 2)))) (and .cse4 (= v_main_~k~0_47 4) (<= 0 .cse5) (= (mod (+ v_main_~i~0_92 v_main_~i~0_91 1) 2) 0) .cse3 (forall ((v_itHalf_9 Int)) (or (not (<= v_itHalf_9 (div (+ v_main_~i~0_92 (* v_main_~i~0_91 (- 1)) 1) (- 2)))) (not (<= 1 v_itHalf_9)) (let ((.cse6 (* (* v_main_~i~0_92 v_itHalf_9) 18)) (.cse7 (* (* v_itHalf_9 v_itHalf_9) 18))) (and (< (+ v_main_~i~0_92 v_main_~j~0_177 .cse6 (* v_itHalf_9 11) .cse7) 19) (< (+ (* v_main_~i~0_92 2) v_main_~j~0_177 (* v_itHalf_9 13) .cse6 .cse7) 18) (< (+ v_main_~j~0_177 .cse6 (* v_main_~i~0_92 6) (* v_itHalf_9 21) .cse7) 14) (< (+ (* v_itHalf_9 9) v_main_~j~0_177 .cse6 .cse7) 20) (< (+ v_main_~j~0_177 .cse6 (* 23 v_itHalf_9) .cse7 (* v_main_~i~0_92 7)) 13) (< (+ v_main_~j~0_177 (* v_itHalf_9 25) .cse6 (* v_main_~i~0_92 8) .cse7) 12) (<= 11 (+ v_main_~j~0_177 (* v_itHalf_9 27) .cse6 (* v_main_~i~0_92 9) .cse7)) (< (+ (* v_main_~i~0_92 3) (* v_itHalf_9 15) v_main_~j~0_177 .cse6 .cse7) 17) (<= (+ v_main_~i~0_92 (* v_itHalf_9 2)) 100) (< (+ v_main_~j~0_177 .cse6 (* 19 v_itHalf_9) .cse7 (* v_main_~i~0_92 5)) 15) (< (+ v_main_~j~0_177 .cse6 (* v_main_~i~0_92 4) .cse7 (* v_itHalf_9 17)) 16))))) (= v_main_~j~0_168 (+ (* (* v_main_~i~0_92 .cse5) 18) (* (* .cse5 .cse5) 18) v_main_~j~0_177 9 .cse8 (* .cse5 27))) .cse2))))) InVars {main_~i~0=v_main_~i~0_92, main_~k~0=v_main_~k~0_48, main_~j~0=v_main_~j~0_177} OutVars{main_~i~0=v_main_~i~0_91, main_~k~0=v_main_~k~0_47, main_~j~0=v_main_~j~0_168} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {2065#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:24,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {2065#(<= main_~i~0 0)} [96] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {2042#false} is VALID [2022-04-15 06:15:24,520 INFO L272 TraceCheckUtils]: 8: Hoare triple {2042#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {2042#false} is VALID [2022-04-15 06:15:24,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {2042#false} ~cond := #in~cond; {2042#false} is VALID [2022-04-15 06:15:24,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {2042#false} assume 0 == ~cond; {2042#false} is VALID [2022-04-15 06:15:24,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {2042#false} assume !false; {2042#false} is VALID [2022-04-15 06:15:24,520 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:15:24,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:15:24,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:24,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369649445] [2022-04-15 06:15:24,520 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:15:24,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463754083] [2022-04-15 06:15:24,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463754083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:24,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:24,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:15:24,824 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:24,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [65270313] [2022-04-15 06:15:24,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [65270313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:24,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:24,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 06:15:24,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137835226] [2022-04-15 06:15:24,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:24,825 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 2 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 24 [2022-04-15 06:15:24,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:24,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 2 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:15:24,842 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:15:24,843 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 06:15:24,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:24,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 06:15:24,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:15:24,844 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 2 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:15:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:25,317 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-15 06:15:25,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 06:15:25,318 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 2 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 24 [2022-04-15 06:15:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 2 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:15:25,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-15 06:15:25,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 2 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:15:25,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-15 06:15:25,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2022-04-15 06:15:25,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:25,346 INFO L225 Difference]: With dead ends: 35 [2022-04-15 06:15:25,346 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 06:15:25,347 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2022-04-15 06:15:25,347 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:25,347 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:15:25,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 06:15:25,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 06:15:25,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:25,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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:15:25,391 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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:15:25,391 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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:15:25,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:25,391 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 06:15:25,391 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 06:15:25,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:25,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:25,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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 26 states. [2022-04-15 06:15:25,392 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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 26 states. [2022-04-15 06:15:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:25,392 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 06:15:25,392 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 06:15:25,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:25,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:25,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:25,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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:15:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-15 06:15:25,393 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 24 [2022-04-15 06:15:25,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:25,393 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-15 06:15:25,394 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 2 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:15:25,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-15 06:15:25,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:25,426 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 06:15:25,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 06:15:25,427 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:25,427 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:25,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 06:15:25,633 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:25,633 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:25,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:25,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1881492059, now seen corresponding path program 10 times [2022-04-15 06:15:25,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:25,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1130754052] [2022-04-15 06:15:29,150 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:15:33,363 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:15:37,498 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:15:37,720 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:40,533 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:40,540 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:15:40,548 INFO L85 PathProgramCache]: Analyzing trace with hash 756538106, now seen corresponding path program 1 times [2022-04-15 06:15:40,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:40,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494291144] [2022-04-15 06:15:40,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:40,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:40,558 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:15:40,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [106646329] [2022-04-15 06:15:40,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:40,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:40,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:40,559 INFO L229 MonitoredProcess]: Starting monitored process 11 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:15:40,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 06:15:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:40,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:15:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:40,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:41,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {2284#true} call ULTIMATE.init(); {2284#true} is VALID [2022-04-15 06:15:41,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {2284#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2284#true} is VALID [2022-04-15 06:15:41,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {2284#true} assume true; {2284#true} is VALID [2022-04-15 06:15:41,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2284#true} {2284#true} #75#return; {2284#true} is VALID [2022-04-15 06:15:41,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {2284#true} call #t~ret1 := main(); {2284#true} is VALID [2022-04-15 06:15:41,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {2284#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {2304#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:15:41,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {2304#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [99] L35-3-->L29-2_primed: Formula: (let ((.cse8 (* 10 v_main_~i~0_101))) (let ((.cse0 (= v_main_~i~0_101 v_main_~i~0_100)) (.cse1 (= v_main_~j~0_206 v_main_~j~0_196)) (.cse5 (<= v_main_~i~0_101 100)) (.cse2 (< (+ v_main_~j~0_206 (* 9 v_main_~i~0_101)) 11)) (.cse4 (<= 10 (+ v_main_~j~0_206 .cse8)))) (or (and .cse0 .cse1 (= v_main_~k~0_52 v_main_~k~0_51)) (let ((.cse3 (div (+ (- 1) (* (- 1) v_main_~i~0_101) v_main_~i~0_100) 2))) (and (= (mod (+ v_main_~i~0_101 v_main_~i~0_100 1) 2) 0) (= v_main_~k~0_51 4) .cse2 (<= 0 .cse3) .cse4 .cse5 (forall ((v_itHalf_10 Int)) (or (not (<= v_itHalf_10 (div (+ (- 1) (* (- 1) v_main_~i~0_101) v_main_~i~0_100) 2))) (let ((.cse6 (* (* v_itHalf_10 v_main_~i~0_101) 20)) (.cse7 (* 20 (* v_itHalf_10 v_itHalf_10)))) (and (< (+ v_main_~j~0_206 .cse6 .cse7 (* v_itHalf_10 24) (* 7 v_main_~i~0_101)) 13) (<= (+ (* v_itHalf_10 2) v_main_~i~0_101) 100) (< (+ (* 8 v_main_~i~0_101) (* v_itHalf_10 26) v_main_~j~0_206 .cse6 .cse7) 12) (< (+ v_main_~j~0_206 (* 3 v_main_~i~0_101) .cse6 .cse7 (* v_itHalf_10 16)) 17) (< (+ (* v_itHalf_10 20) v_main_~j~0_206 .cse6 .cse7 (* 5 v_main_~i~0_101)) 15) (< (+ v_main_~j~0_206 .cse6 .cse7 v_main_~i~0_101 (* v_itHalf_10 12)) 19) (< (+ (* v_itHalf_10 18) (* 4 v_main_~i~0_101) v_main_~j~0_206 .cse6 .cse7) 16) (<= 10 (+ v_main_~j~0_206 (* v_itHalf_10 30) (* 10 v_main_~i~0_101) .cse6 .cse7)) (< (+ v_main_~j~0_206 .cse6 .cse7 (* v_itHalf_10 10)) 20) (< (+ v_main_~j~0_206 (* v_itHalf_10 14) (* 2 v_main_~i~0_101) .cse6 .cse7) 18) (< (+ (* v_itHalf_10 22) v_main_~j~0_206 (* 6 v_main_~i~0_101) .cse6 .cse7) 14) (< (+ v_main_~j~0_206 .cse6 .cse7 (* 9 v_main_~i~0_101) (* v_itHalf_10 28)) 11))) (not (<= 1 v_itHalf_10)))) (= v_main_~j~0_196 (+ v_main_~j~0_206 .cse8 (* 30 .cse3) (* 20 (* .cse3 v_main_~i~0_101)) 10 (* (* .cse3 .cse3) 20))))) (and .cse0 .cse1 (or (not .cse5) (not .cse2) (not .cse4)) (= v_main_~k~0_51 v_main_~k~0_52))))) InVars {main_~i~0=v_main_~i~0_101, main_~k~0=v_main_~k~0_52, main_~j~0=v_main_~j~0_206} OutVars{main_~i~0=v_main_~i~0_100, main_~k~0=v_main_~k~0_51, main_~j~0=v_main_~j~0_196} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {2308#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:41,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {2308#(<= main_~i~0 0)} [98] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {2285#false} is VALID [2022-04-15 06:15:41,242 INFO L272 TraceCheckUtils]: 8: Hoare triple {2285#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {2285#false} is VALID [2022-04-15 06:15:41,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {2285#false} ~cond := #in~cond; {2285#false} is VALID [2022-04-15 06:15:41,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {2285#false} assume 0 == ~cond; {2285#false} is VALID [2022-04-15 06:15:41,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {2285#false} assume !false; {2285#false} is VALID [2022-04-15 06:15:41,242 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:15:41,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:15:41,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:41,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494291144] [2022-04-15 06:15:41,242 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:15:41,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106646329] [2022-04-15 06:15:41,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106646329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:41,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:41,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:15:41,632 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:41,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1130754052] [2022-04-15 06:15:41,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1130754052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:41,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:41,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:15:41,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616910504] [2022-04-15 06:15:41,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:41,633 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 2 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 25 [2022-04-15 06:15:41,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:41,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 2 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:15:41,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:41,655 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:15:41,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:41,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:15:41,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-04-15 06:15:41,655 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 2 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:15:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:42,226 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-15 06:15:42,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 06:15:42,226 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 2 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 25 [2022-04-15 06:15:42,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:42,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 2 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:15:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 41 transitions. [2022-04-15 06:15:42,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 2 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:15:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 41 transitions. [2022-04-15 06:15:42,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 41 transitions. [2022-04-15 06:15:42,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:42,272 INFO L225 Difference]: With dead ends: 36 [2022-04-15 06:15:42,272 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 06:15:42,272 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:15:42,273 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:42,273 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:15:42,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 06:15:42,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 06:15:42,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:42,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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:15:42,314 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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:15:42,314 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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:15:42,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:42,314 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 06:15:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 06:15:42,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:42,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:42,315 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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 27 states. [2022-04-15 06:15:42,315 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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 27 states. [2022-04-15 06:15:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:42,315 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 06:15:42,315 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 06:15:42,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:42,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:42,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:42,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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:15:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-15 06:15:42,316 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2022-04-15 06:15:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:42,316 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-15 06:15:42,317 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 2 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:15:42,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-15 06:15:42,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 06:15:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 06:15:42,348 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:42,348 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:42,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 06:15:42,555 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 06:15:42,555 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:42,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:42,556 INFO L85 PathProgramCache]: Analyzing trace with hash -28758444, now seen corresponding path program 11 times [2022-04-15 06:15:42,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:42,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1766866336] [2022-04-15 06:15:44,666 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:15:48,880 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:15:49,039 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:15:49,296 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:51,121 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:51,127 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:15:51,134 INFO L85 PathProgramCache]: Analyzing trace with hash 815643450, now seen corresponding path program 1 times [2022-04-15 06:15:51,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:51,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790379697] [2022-04-15 06:15:51,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:51,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:51,152 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:15:51,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [38832007] [2022-04-15 06:15:51,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:51,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:51,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:51,153 INFO L229 MonitoredProcess]: Starting monitored process 12 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:15:51,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 06:15:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:51,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:15:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:51,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:51,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2536#true} is VALID [2022-04-15 06:15:51,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {2536#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2536#true} is VALID [2022-04-15 06:15:51,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-15 06:15:51,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2536#true} {2536#true} #75#return; {2536#true} is VALID [2022-04-15 06:15:51,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {2536#true} call #t~ret1 := main(); {2536#true} is VALID [2022-04-15 06:15:51,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {2536#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {2556#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:15:51,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {2556#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [101] L35-3-->L29-2_primed: Formula: (let ((.cse3 (* 11 v_main_~i~0_110))) (let ((.cse4 (<= v_main_~i~0_110 100)) (.cse6 (< (+ v_main_~j~0_237 (* 10 v_main_~i~0_110)) 10)) (.cse5 (<= 9 (+ v_main_~j~0_237 .cse3))) (.cse7 (= v_main_~k~0_56 v_main_~k~0_55))) (or (let ((.cse2 (div (+ (- 1) (* (- 1) v_main_~i~0_110) v_main_~i~0_109) 2))) (and (forall ((v_itHalf_11 Int)) (or (not (<= 0 v_itHalf_11)) (not (<= (+ v_itHalf_11 1) (div (+ (- 1) (* (- 1) v_main_~i~0_110) v_main_~i~0_109) 2))) (let ((.cse0 (* 22 (* v_itHalf_11 v_main_~i~0_110))) (.cse1 (* (* v_itHalf_11 v_itHalf_11) 22))) (and (< (+ v_main_~j~0_237 (* 17 v_main_~i~0_110) 3 .cse0 .cse1 (* v_itHalf_11 45)) 0) (<= 0 (+ v_main_~j~0_237 .cse0 .cse1 13 (* 22 v_main_~i~0_110) (* v_itHalf_11 55))) (< (+ v_main_~j~0_237 (* 11 v_main_~i~0_110) .cse0 .cse1 (* v_itHalf_11 33)) 9) (< (+ v_main_~j~0_237 (* v_itHalf_11 35) (* 12 v_main_~i~0_110) .cse0 .cse1) 7) (< (+ v_main_~j~0_237 (* 41 v_itHalf_11) (* 15 v_main_~i~0_110) .cse0 .cse1) 1) (< (+ v_main_~j~0_237 (* v_itHalf_11 37) (* 13 v_main_~i~0_110) .cse0 .cse1) 5) (< (+ v_main_~j~0_237 .cse0 .cse1 (* 21 v_main_~i~0_110) 11 (* 53 v_itHalf_11)) 0) (<= (+ (* v_itHalf_11 2) v_main_~i~0_110) 99) (< (+ (* 20 v_main_~i~0_110) (* v_itHalf_11 51) v_main_~j~0_237 9 .cse0 .cse1) 0) (< (+ v_main_~j~0_237 (* 14 v_main_~i~0_110) .cse0 (* v_itHalf_11 39) .cse1) 3) (< (+ (* 18 v_main_~i~0_110) v_main_~j~0_237 5 .cse0 .cse1 (* v_itHalf_11 47)) 0) (< (+ v_main_~j~0_237 7 (* v_itHalf_11 49) .cse0 .cse1 (* 19 v_main_~i~0_110)) 0) (< (+ v_main_~j~0_237 (* v_itHalf_11 43) .cse0 .cse1 (* 16 v_main_~i~0_110) 1) 0))))) (<= 0 .cse2) (= (+ v_main_~j~0_237 (* (* .cse2 .cse2) 22) .cse3 (* 22 (* .cse2 v_main_~i~0_110)) (* .cse2 33) 11) v_main_~j~0_226) .cse4 (= v_main_~k~0_55 4) (= (mod (+ v_main_~i~0_109 v_main_~i~0_110 1) 2) 0) .cse5 .cse6)) (and (= v_main_~i~0_109 v_main_~i~0_110) (or (not .cse4) (not .cse6) (not .cse5)) (= v_main_~j~0_226 v_main_~j~0_237) .cse7) (and (= v_main_~j~0_237 v_main_~j~0_226) .cse7 (= v_main_~i~0_110 v_main_~i~0_109))))) InVars {main_~i~0=v_main_~i~0_110, main_~k~0=v_main_~k~0_56, main_~j~0=v_main_~j~0_237} OutVars{main_~i~0=v_main_~i~0_109, main_~k~0=v_main_~k~0_55, main_~j~0=v_main_~j~0_226} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {2560#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:51,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {2560#(<= main_~i~0 0)} [100] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {2537#false} is VALID [2022-04-15 06:15:51,723 INFO L272 TraceCheckUtils]: 8: Hoare triple {2537#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {2537#false} is VALID [2022-04-15 06:15:51,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {2537#false} ~cond := #in~cond; {2537#false} is VALID [2022-04-15 06:15:51,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {2537#false} assume 0 == ~cond; {2537#false} is VALID [2022-04-15 06:15:51,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2022-04-15 06:15:51,723 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:15:51,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:15:51,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:51,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790379697] [2022-04-15 06:15:51,723 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:15:51,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38832007] [2022-04-15 06:15:51,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38832007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:51,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:51,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:15:52,101 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:52,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1766866336] [2022-04-15 06:15:52,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1766866336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:52,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:52,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 06:15:52,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451752603] [2022-04-15 06:15:52,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:52,102 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 2 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 26 [2022-04-15 06:15:52,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:52,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 2 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:15:52,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:52,120 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 06:15:52,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:52,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 06:15:52,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2022-04-15 06:15:52,121 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 2 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:15:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:52,722 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-15 06:15:52,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 06:15:52,722 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 2 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 26 [2022-04-15 06:15:52,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 2 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:15:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 42 transitions. [2022-04-15 06:15:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 2 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:15:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 42 transitions. [2022-04-15 06:15:52,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 42 transitions. [2022-04-15 06:15:52,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:52,756 INFO L225 Difference]: With dead ends: 37 [2022-04-15 06:15:52,756 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 06:15:52,757 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=544, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:15:52,757 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:52,758 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:15:52,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 06:15:52,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-15 06:15:52,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:52,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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:15:52,810 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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:15:52,810 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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:15:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:52,811 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-15 06:15:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 06:15:52,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:52,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:52,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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 28 states. [2022-04-15 06:15:52,811 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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 28 states. [2022-04-15 06:15:52,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:52,812 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-15 06:15:52,812 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 06:15:52,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:52,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:52,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:52,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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:15:52,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-15 06:15:52,813 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 26 [2022-04-15 06:15:52,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:52,813 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-15 06:15:52,813 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 2 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:15:52,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2022-04-15 06:15:52,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:52,849 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 06:15:52,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 06:15:52,849 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:52,849 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:52,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 06:15:53,059 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 06:15:53,059 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:53,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:53,060 INFO L85 PathProgramCache]: Analyzing trace with hash 883018107, now seen corresponding path program 12 times [2022-04-15 06:15:53,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:53,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [421010042] [2022-04-15 06:15:56,496 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:16:00,728 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:16:06,952 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:16:07,159 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:16:08,894 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:16:08,900 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:16:08,909 INFO L85 PathProgramCache]: Analyzing trace with hash 874748794, now seen corresponding path program 1 times [2022-04-15 06:16:08,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:16:08,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617410014] [2022-04-15 06:16:08,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:16:08,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:16:08,920 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:16:08,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1132931901] [2022-04-15 06:16:08,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:16:08,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:16:08,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:16:08,922 INFO L229 MonitoredProcess]: Starting monitored process 13 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:16:08,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 06:16:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:08,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:16:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:08,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:16:09,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {2797#true} call ULTIMATE.init(); {2797#true} is VALID [2022-04-15 06:16:09,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {2797#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2797#true} is VALID [2022-04-15 06:16:09,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {2797#true} assume true; {2797#true} is VALID [2022-04-15 06:16:09,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2797#true} {2797#true} #75#return; {2797#true} is VALID [2022-04-15 06:16:09,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {2797#true} call #t~ret1 := main(); {2797#true} is VALID [2022-04-15 06:16:09,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {2797#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {2817#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:16:09,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {2817#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [103] L35-3-->L29-2_primed: Formula: (let ((.cse1 (* 12 v_main_~i~0_119))) (let ((.cse2 (<= 8 (+ v_main_~j~0_270 .cse1))) (.cse6 (< (+ v_main_~j~0_270 (* 11 v_main_~i~0_119)) 9)) (.cse5 (<= v_main_~i~0_119 100)) (.cse7 (= v_main_~j~0_270 v_main_~j~0_258)) (.cse8 (= v_main_~i~0_119 v_main_~i~0_118))) (or (let ((.cse0 (div (+ (- 1) (* (- 1) v_main_~i~0_119) v_main_~i~0_118) 2))) (and (= (mod (+ v_main_~i~0_119 v_main_~i~0_118 1) 2) 0) (= v_main_~k~0_59 4) (= v_main_~j~0_258 (+ (* (* .cse0 .cse0) 24) v_main_~j~0_270 (* .cse0 36) .cse1 12 (* (* .cse0 v_main_~i~0_119) 24))) (<= 0 .cse0) .cse2 (forall ((v_itHalf_12 Int)) (or (let ((.cse3 (* (* v_itHalf_12 v_main_~i~0_119) 24)) (.cse4 (* (* v_itHalf_12 v_itHalf_12) 24))) (and (< (+ v_main_~j~0_270 .cse3 (* 21 v_main_~i~0_119) .cse4 (* v_itHalf_12 54) 10) 0) (< (+ v_main_~j~0_270 .cse3 14 .cse4 (* 23 v_main_~i~0_119) (* v_itHalf_12 58)) 0) (< (+ v_main_~j~0_270 .cse3 (* 13 v_main_~i~0_119) (* v_itHalf_12 38) .cse4) 6) (< (+ (* v_itHalf_12 36) v_main_~j~0_270 .cse3 .cse4 (* 12 v_main_~i~0_119)) 8) (< (+ (* v_itHalf_12 50) v_main_~j~0_270 .cse3 6 .cse4 (* 19 v_main_~i~0_119)) 0) (< (+ (* 16 v_main_~i~0_119) (* v_itHalf_12 44) v_main_~j~0_270 .cse3 .cse4) 0) (<= 0 (+ v_main_~j~0_270 .cse3 16 (* v_itHalf_12 60) .cse4 (* v_main_~i~0_119 24))) (< (+ v_main_~j~0_270 .cse3 2 .cse4 (* 17 v_main_~i~0_119) (* v_itHalf_12 46)) 0) (<= (+ (* v_itHalf_12 2) v_main_~i~0_119) 99) (< (+ (* 56 v_itHalf_12) v_main_~j~0_270 (* 22 v_main_~i~0_119) .cse3 .cse4 12) 0) (< (+ v_main_~j~0_270 .cse3 .cse4 (* 14 v_main_~i~0_119) (* 40 v_itHalf_12)) 4) (< (+ (* 20 v_main_~i~0_119) v_main_~j~0_270 .cse3 (* v_itHalf_12 52) .cse4 8) 0) (< (+ (* v_itHalf_12 42) v_main_~j~0_270 .cse3 (* 15 v_main_~i~0_119) .cse4) 2) (< (+ v_main_~j~0_270 .cse3 .cse4 (* 18 v_main_~i~0_119) (* v_itHalf_12 48) 4) 0))) (not (<= 0 v_itHalf_12)) (not (<= (+ v_itHalf_12 1) (div (+ (- 1) (* (- 1) v_main_~i~0_119) v_main_~i~0_118) 2))))) .cse5 .cse6)) (and .cse7 (or (not .cse2) (not .cse6) (not .cse5)) (= v_main_~k~0_59 v_main_~k~0_60) .cse8) (and .cse7 .cse8 (= v_main_~k~0_60 v_main_~k~0_59))))) InVars {main_~i~0=v_main_~i~0_119, main_~k~0=v_main_~k~0_60, main_~j~0=v_main_~j~0_270} OutVars{main_~i~0=v_main_~i~0_118, main_~k~0=v_main_~k~0_59, main_~j~0=v_main_~j~0_258} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {2821#(<= main_~i~0 0)} is VALID [2022-04-15 06:16:09,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {2821#(<= main_~i~0 0)} [102] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {2798#false} is VALID [2022-04-15 06:16:09,449 INFO L272 TraceCheckUtils]: 8: Hoare triple {2798#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {2798#false} is VALID [2022-04-15 06:16:09,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {2798#false} ~cond := #in~cond; {2798#false} is VALID [2022-04-15 06:16:09,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {2798#false} assume 0 == ~cond; {2798#false} is VALID [2022-04-15 06:16:09,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {2798#false} assume !false; {2798#false} is VALID [2022-04-15 06:16:09,450 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:16:09,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:16:09,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:16:09,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617410014] [2022-04-15 06:16:09,450 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:16:09,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132931901] [2022-04-15 06:16:09,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132931901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:16:09,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:16:09,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:16:09,886 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:16:09,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [421010042] [2022-04-15 06:16:09,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [421010042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:16:09,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:16:09,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 06:16:09,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945877814] [2022-04-15 06:16:09,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:16:09,887 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 2 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 27 [2022-04-15 06:16:09,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:16:09,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 2 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:16:09,908 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:16:09,908 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 06:16:09,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:16:09,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 06:16:09,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:16:09,909 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 2 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:16:10,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:16:10,605 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-15 06:16:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 06:16:10,605 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 2 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 27 [2022-04-15 06:16:10,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:16:10,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 2 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:16:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 43 transitions. [2022-04-15 06:16:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 2 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:16:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 43 transitions. [2022-04-15 06:16:10,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 43 transitions. [2022-04-15 06:16:10,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:16:10,639 INFO L225 Difference]: With dead ends: 38 [2022-04-15 06:16:10,639 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 06:16:10,639 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=242, Invalid=628, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:16:10,640 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:16:10,640 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:16:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 06:16:10,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 06:16:10,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:16:10,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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:16:10,701 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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:16:10,701 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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:16:10,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:16:10,705 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 06:16:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 06:16:10,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:16:10,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:16:10,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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 29 states. [2022-04-15 06:16:10,706 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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 29 states. [2022-04-15 06:16:10,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:16:10,706 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 06:16:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 06:16:10,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:16:10,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:16:10,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:16:10,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:16:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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:16:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-15 06:16:10,707 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2022-04-15 06:16:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:16:10,707 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-15 06:16:10,707 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 2 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:16:10,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-15 06:16:10,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:16:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 06:16:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 06:16:10,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:16:10,747 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:16:10,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 06:16:10,948 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 06:16:10,948 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:16:10,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:16:10,948 INFO L85 PathProgramCache]: Analyzing trace with hash -916679884, now seen corresponding path program 13 times [2022-04-15 06:16:10,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:16:10,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [433386692] [2022-04-15 06:16:17,590 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:16:21,803 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:16:31,942 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:16:32,197 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:16:34,386 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:16:34,393 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:16:34,401 INFO L85 PathProgramCache]: Analyzing trace with hash 933854138, now seen corresponding path program 1 times [2022-04-15 06:16:34,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:16:34,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274742777] [2022-04-15 06:16:34,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:16:34,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:16:34,412 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:16:34,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1500690661] [2022-04-15 06:16:34,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:16:34,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:16:34,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:16:34,413 INFO L229 MonitoredProcess]: Starting monitored process 14 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:16:34,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 06:16:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:34,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:16:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:34,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:16:35,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3067#true} is VALID [2022-04-15 06:16:35,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {3067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3067#true} is VALID [2022-04-15 06:16:35,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-15 06:16:35,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #75#return; {3067#true} is VALID [2022-04-15 06:16:35,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret1 := main(); {3067#true} is VALID [2022-04-15 06:16:35,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {3067#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {3087#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:16:35,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {3087#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [105] L35-3-->L29-2_primed: Formula: (let ((.cse7 (* 13 v_main_~i~0_128))) (let ((.cse2 (< (+ v_main_~j~0_305 (* 12 v_main_~i~0_128)) 8)) (.cse3 (<= 7 (+ v_main_~j~0_305 .cse7))) (.cse1 (<= v_main_~i~0_128 100)) (.cse0 (= v_main_~k~0_64 v_main_~k~0_63)) (.cse4 (= v_main_~i~0_128 v_main_~i~0_127)) (.cse5 (= v_main_~j~0_305 v_main_~j~0_292))) (or (and .cse0 (or (not .cse1) (not .cse2) (not .cse3)) .cse4 .cse5) (let ((.cse6 (div (+ (* (- 1) v_main_~i~0_127) v_main_~i~0_128 1) (- 2)))) (and (<= 0 .cse6) (= v_main_~j~0_292 (+ (* 26 (* .cse6 v_main_~i~0_128)) v_main_~j~0_305 (* 39 .cse6) .cse7 13 (* (* .cse6 .cse6) 26))) .cse2 (= v_main_~k~0_63 4) (forall ((v_itHalf_13 Int)) (or (not (<= v_itHalf_13 (div (+ (* (- 1) v_main_~i~0_127) v_main_~i~0_128 1) (- 2)))) (not (<= 1 v_itHalf_13)) (let ((.cse8 (* (* v_itHalf_13 v_main_~i~0_128) 26)) (.cse9 (* (* v_itHalf_13 v_itHalf_13) 26))) (and (< (+ v_main_~j~0_305 .cse8 (* v_itHalf_13 17) (* 2 v_main_~i~0_128) .cse9) 18) (<= (+ (* v_itHalf_13 2) v_main_~i~0_128) 100) (< (+ v_main_~j~0_305 (* v_itHalf_13 21) (* 4 v_main_~i~0_128) .cse8 .cse9) 16) (< (+ v_main_~j~0_305 .cse8 .cse9 (* 10 v_main_~i~0_128) (* v_itHalf_13 33)) 10) (<= 7 (+ v_main_~j~0_305 (* v_itHalf_13 39) .cse8 (* 13 v_main_~i~0_128) .cse9)) (< (+ v_main_~j~0_305 .cse8 (* 8 v_main_~i~0_128) .cse9 (* v_itHalf_13 29)) 12) (< (+ (* 23 v_itHalf_13) v_main_~j~0_305 .cse8 .cse9 (* 5 v_main_~i~0_128)) 15) (< (+ v_main_~j~0_305 .cse8 (* v_itHalf_13 35) .cse9 (* 11 v_main_~i~0_128)) 9) (< (+ v_main_~j~0_305 .cse8 (* 6 v_main_~i~0_128) (* v_itHalf_13 25) .cse9) 14) (< (+ v_main_~j~0_305 .cse8 (* 19 v_itHalf_13) .cse9 (* 3 v_main_~i~0_128)) 17) (< (+ v_main_~j~0_305 .cse8 .cse9 v_main_~i~0_128 (* v_itHalf_13 15)) 19) (< (+ v_main_~j~0_305 .cse8 (* v_itHalf_13 31) (* 9 v_main_~i~0_128) .cse9) 11) (< (+ v_main_~j~0_305 (* v_itHalf_13 37) .cse8 (* 12 v_main_~i~0_128) .cse9) 8) (< (+ v_main_~j~0_305 .cse8 (* v_itHalf_13 13) .cse9) 20) (< (+ v_main_~j~0_305 (* v_itHalf_13 27) .cse8 (* 7 v_main_~i~0_128) .cse9) 13))))) .cse3 (= (mod (+ v_main_~i~0_128 v_main_~i~0_127 1) 2) 0) .cse1)) (and .cse0 .cse4 .cse5)))) InVars {main_~i~0=v_main_~i~0_128, main_~k~0=v_main_~k~0_64, main_~j~0=v_main_~j~0_305} OutVars{main_~i~0=v_main_~i~0_127, main_~k~0=v_main_~k~0_63, main_~j~0=v_main_~j~0_292} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {3091#(<= main_~i~0 0)} is VALID [2022-04-15 06:16:35,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {3091#(<= main_~i~0 0)} [104] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {3068#false} is VALID [2022-04-15 06:16:35,149 INFO L272 TraceCheckUtils]: 8: Hoare triple {3068#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {3068#false} is VALID [2022-04-15 06:16:35,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {3068#false} ~cond := #in~cond; {3068#false} is VALID [2022-04-15 06:16:35,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {3068#false} assume 0 == ~cond; {3068#false} is VALID [2022-04-15 06:16:35,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2022-04-15 06:16:35,149 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:16:35,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:16:35,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:16:35,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274742777] [2022-04-15 06:16:35,150 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:16:35,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500690661] [2022-04-15 06:16:35,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500690661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:16:35,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:16:35,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:16:35,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:16:35,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [433386692] [2022-04-15 06:16:35,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [433386692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:16:35,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:16:35,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 06:16:35,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472567400] [2022-04-15 06:16:35,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:16:35,661 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 2 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 28 [2022-04-15 06:16:35,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:16:35,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 2 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:16:35,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:16:35,689 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 06:16:35,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:16:35,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 06:16:35,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2022-04-15 06:16:35,690 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 2 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:16:36,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:16:36,516 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-15 06:16:36,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 06:16:36,516 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 2 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 28 [2022-04-15 06:16:36,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:16:36,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 2 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:16:36,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 44 transitions. [2022-04-15 06:16:36,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 2 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:16:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 44 transitions. [2022-04-15 06:16:36,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 44 transitions. [2022-04-15 06:16:36,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:16:36,561 INFO L225 Difference]: With dead ends: 39 [2022-04-15 06:16:36,561 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 06:16:36,561 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=274, Invalid=718, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:16:36,562 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:16:36,562 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:16:36,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 06:16:36,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 06:16:36,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:16:36,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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:16:36,625 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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:16:36,625 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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:16:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:16:36,626 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-15 06:16:36,626 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 06:16:36,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:16:36,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:16:36,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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 30 states. [2022-04-15 06:16:36,627 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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 30 states. [2022-04-15 06:16:36,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:16:36,627 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-15 06:16:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 06:16:36,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:16:36,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:16:36,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:16:36,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:16:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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:16:36,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-15 06:16:36,628 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2022-04-15 06:16:36,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:16:36,629 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-15 06:16:36,629 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 2 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:16:36,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-15 06:16:36,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:16:36,674 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 06:16:36,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 06:16:36,675 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:16:36,675 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:16:36,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 06:16:36,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 06:16:36,876 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:16:36,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:16:36,876 INFO L85 PathProgramCache]: Analyzing trace with hash -872742757, now seen corresponding path program 14 times [2022-04-15 06:16:36,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:16:36,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2002222813] [2022-04-15 06:16:45,024 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:16:49,291 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:16:54,402 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:16:54,701 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:16:58,700 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:16:58,707 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:16:58,715 INFO L85 PathProgramCache]: Analyzing trace with hash 992959482, now seen corresponding path program 1 times [2022-04-15 06:16:58,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:16:58,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020988291] [2022-04-15 06:16:58,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:16:58,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:16:58,728 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:16:58,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2068204226] [2022-04-15 06:16:58,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:16:58,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:16:58,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:16:58,729 INFO L229 MonitoredProcess]: Starting monitored process 15 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:16:58,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 06:16:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:58,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:16:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:16:58,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:16:59,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {3346#true} call ULTIMATE.init(); {3346#true} is VALID [2022-04-15 06:16:59,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {3346#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3346#true} is VALID [2022-04-15 06:16:59,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {3346#true} assume true; {3346#true} is VALID [2022-04-15 06:16:59,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3346#true} {3346#true} #75#return; {3346#true} is VALID [2022-04-15 06:16:59,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {3346#true} call #t~ret1 := main(); {3346#true} is VALID [2022-04-15 06:16:59,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {3346#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {3366#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:16:59,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {3366#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [107] L35-3-->L29-2_primed: Formula: (let ((.cse8 (* 14 v_main_~i~0_137))) (let ((.cse4 (<= 6 (+ .cse8 v_main_~j~0_342))) (.cse2 (< (+ v_main_~j~0_342 (* 13 v_main_~i~0_137)) 7)) (.cse3 (<= v_main_~i~0_137 100)) (.cse0 (= v_main_~k~0_68 v_main_~k~0_67)) (.cse1 (= v_main_~j~0_342 v_main_~j~0_328))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3) (not .cse4)) (= v_main_~i~0_136 v_main_~i~0_137)) (let ((.cse7 (div (+ (* (- 1) v_main_~i~0_136) v_main_~i~0_137 1) (- 2)))) (and (= v_main_~k~0_67 4) (= (mod (+ v_main_~i~0_136 v_main_~i~0_137 1) 2) 0) .cse4 (forall ((v_itHalf_14 Int)) (or (not (<= 1 v_itHalf_14)) (let ((.cse5 (* (* v_itHalf_14 v_main_~i~0_137) 28)) (.cse6 (* 28 (* v_itHalf_14 v_itHalf_14)))) (and (< (+ v_main_~j~0_342 (* v_itHalf_14 26) (* 6 v_main_~i~0_137) .cse5 .cse6) 14) (< (+ v_main_~j~0_342 (* v_itHalf_14 38) (* 12 v_main_~i~0_137) .cse5 .cse6) 8) (< (+ v_main_~j~0_342 (* v_itHalf_14 22) .cse5 .cse6 (* 4 v_main_~i~0_137)) 16) (< (+ (* v_itHalf_14 34) v_main_~j~0_342 (* 10 v_main_~i~0_137) .cse5 .cse6) 10) (< (+ v_main_~j~0_342 (* 8 v_main_~i~0_137) .cse5 .cse6 (* v_itHalf_14 30)) 12) (< (+ v_main_~j~0_342 (* v_itHalf_14 18) (* 2 v_main_~i~0_137) .cse5 .cse6) 18) (< (+ v_main_~j~0_342 (* 11 v_main_~i~0_137) .cse5 .cse6 (* v_itHalf_14 36)) 9) (<= (+ (* v_itHalf_14 2) v_main_~i~0_137) 100) (< (+ v_main_~j~0_342 (* v_itHalf_14 24) (* 5 v_main_~i~0_137) .cse5 .cse6) 15) (< (+ v_main_~j~0_342 (* v_itHalf_14 32) (* 9 v_main_~i~0_137) .cse5 .cse6) 11) (< (+ v_main_~j~0_342 (* 3 v_main_~i~0_137) .cse5 .cse6 (* v_itHalf_14 20)) 17) (< (+ v_main_~j~0_342 (* v_itHalf_14 16) .cse5 .cse6 v_main_~i~0_137) 19) (<= 6 (+ (* 14 v_main_~i~0_137) v_main_~j~0_342 (* v_itHalf_14 42) .cse5 .cse6)) (< (+ (* v_itHalf_14 14) v_main_~j~0_342 .cse5 .cse6) 20) (< (+ v_main_~j~0_342 (* 7 v_main_~i~0_137) (* v_itHalf_14 28) .cse5 .cse6) 13) (< (+ v_main_~j~0_342 (* 40 v_itHalf_14) .cse5 .cse6 (* 13 v_main_~i~0_137)) 7))) (not (<= v_itHalf_14 (div (+ (* (- 1) v_main_~i~0_136) v_main_~i~0_137 1) (- 2)))))) (<= 0 .cse7) .cse2 .cse3 (= v_main_~j~0_328 (+ .cse8 v_main_~j~0_342 (* (* .cse7 v_main_~i~0_137) 28) 14 (* 42 .cse7) (* (* .cse7 .cse7) 28))))) (and .cse0 (= v_main_~i~0_137 v_main_~i~0_136) .cse1)))) InVars {main_~i~0=v_main_~i~0_137, main_~k~0=v_main_~k~0_68, main_~j~0=v_main_~j~0_342} OutVars{main_~i~0=v_main_~i~0_136, main_~k~0=v_main_~k~0_67, main_~j~0=v_main_~j~0_328} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {3370#(<= main_~i~0 0)} is VALID [2022-04-15 06:16:59,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {3370#(<= main_~i~0 0)} [106] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {3347#false} is VALID [2022-04-15 06:16:59,338 INFO L272 TraceCheckUtils]: 8: Hoare triple {3347#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {3347#false} is VALID [2022-04-15 06:16:59,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {3347#false} ~cond := #in~cond; {3347#false} is VALID [2022-04-15 06:16:59,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {3347#false} assume 0 == ~cond; {3347#false} is VALID [2022-04-15 06:16:59,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {3347#false} assume !false; {3347#false} is VALID [2022-04-15 06:16:59,339 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:16:59,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:16:59,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:16:59,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020988291] [2022-04-15 06:16:59,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:16:59,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068204226] [2022-04-15 06:16:59,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068204226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:16:59,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:16:59,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:16:59,913 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:16:59,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2002222813] [2022-04-15 06:16:59,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2002222813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:16:59,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:16:59,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 06:16:59,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729620306] [2022-04-15 06:16:59,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:16:59,914 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 2 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 29 [2022-04-15 06:16:59,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:16:59,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 2 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:16:59,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:16:59,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 06:16:59,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:16:59,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 06:16:59,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:16:59,941 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 2 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:17:00,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:00,984 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-15 06:17:00,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 06:17:00,985 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 2 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 29 [2022-04-15 06:17:00,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:17:00,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 2 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:17:00,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 45 transitions. [2022-04-15 06:17:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 2 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:17:00,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 45 transitions. [2022-04-15 06:17:00,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 45 transitions. [2022-04-15 06:17:01,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:01,023 INFO L225 Difference]: With dead ends: 40 [2022-04-15 06:17:01,024 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 06:17:01,024 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=308, Invalid=814, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 06:17:01,025 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:17:01,025 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:17:01,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 06:17:01,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 06:17:01,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:17:01,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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:17:01,096 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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:17:01,096 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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:17:01,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:01,097 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-15 06:17:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 06:17:01,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:01,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:01,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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 31 states. [2022-04-15 06:17:01,097 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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 31 states. [2022-04-15 06:17:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:01,098 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-15 06:17:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 06:17:01,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:01,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:01,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:17:01,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:17:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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:17:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-15 06:17:01,099 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 29 [2022-04-15 06:17:01,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:17:01,099 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-15 06:17:01,099 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 2 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:17:01,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-15 06:17:01,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 06:17:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 06:17:01,174 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:17:01,175 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:17:01,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 06:17:01,375 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:17:01,376 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:17:01,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:17:01,377 INFO L85 PathProgramCache]: Analyzing trace with hash 489308180, now seen corresponding path program 15 times [2022-04-15 06:17:01,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:17:01,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [97895755] [2022-04-15 06:17:01,993 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:17:06,277 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:17:08,476 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:17:08,873 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:17:11,320 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:17:11,327 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:17:11,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1052064826, now seen corresponding path program 1 times [2022-04-15 06:17:11,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:17:11,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709510735] [2022-04-15 06:17:11,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:17:11,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:17:11,348 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:17:11,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1865296397] [2022-04-15 06:17:11,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:17:11,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:17:11,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:17:11,349 INFO L229 MonitoredProcess]: Starting monitored process 16 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:17:11,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 06:17:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:11,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:17:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:11,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:17:12,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {3634#true} call ULTIMATE.init(); {3634#true} is VALID [2022-04-15 06:17:12,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {3634#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3634#true} is VALID [2022-04-15 06:17:12,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {3634#true} assume true; {3634#true} is VALID [2022-04-15 06:17:12,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3634#true} {3634#true} #75#return; {3634#true} is VALID [2022-04-15 06:17:12,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {3634#true} call #t~ret1 := main(); {3634#true} is VALID [2022-04-15 06:17:12,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {3634#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {3654#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:17:12,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {3654#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [109] L35-3-->L29-2_primed: Formula: (let ((.cse7 (* 15 v_main_~i~0_146))) (let ((.cse0 (= v_main_~k~0_72 v_main_~k~0_71)) (.cse1 (= v_main_~j~0_381 v_main_~j~0_366)) (.cse2 (= v_main_~i~0_146 v_main_~i~0_145)) (.cse5 (<= v_main_~i~0_146 100)) (.cse4 (<= 5 (+ v_main_~j~0_381 .cse7))) (.cse3 (< (+ v_main_~j~0_381 (* 14 v_main_~i~0_146)) 6))) (or (and .cse0 .cse1 .cse2) (and .cse0 (or (not .cse3) (not .cse4) (not .cse5)) .cse1 .cse2) (let ((.cse6 (div (+ (- 1) (* (- 1) v_main_~i~0_146) v_main_~i~0_145) 2))) (and .cse5 .cse4 (= v_main_~k~0_71 4) (= v_main_~j~0_366 (+ (* (* .cse6 v_main_~i~0_146) 30) v_main_~j~0_381 .cse7 15 (* 30 (* .cse6 .cse6)) (* .cse6 45))) (forall ((v_itHalf_15 Int)) (or (not (<= 1 v_itHalf_15)) (let ((.cse8 (* 30 (* v_itHalf_15 v_itHalf_15))) (.cse9 (* 30 (* v_itHalf_15 v_main_~i~0_146)))) (and (< (+ v_main_~j~0_381 (* v_itHalf_15 17) .cse8 v_main_~i~0_146 .cse9) 19) (< (+ v_main_~j~0_381 (* 5 v_main_~i~0_146) .cse8 (* v_itHalf_15 25) .cse9) 15) (< (+ v_main_~j~0_381 (* 23 v_itHalf_15) (* 4 v_main_~i~0_146) .cse8 .cse9) 16) (< (+ (* v_itHalf_15 31) v_main_~j~0_381 .cse8 (* 8 v_main_~i~0_146) .cse9) 12) (< (+ v_main_~j~0_381 (* v_itHalf_15 39) (* 12 v_main_~i~0_146) .cse8 .cse9) 8) (< (+ v_main_~j~0_381 (* v_itHalf_15 33) .cse8 (* 9 v_main_~i~0_146) .cse9) 11) (< (+ v_main_~j~0_381 .cse8 (* v_itHalf_15 15) .cse9) 20) (< (+ (* 11 v_main_~i~0_146) v_main_~j~0_381 .cse8 (* v_itHalf_15 37) .cse9) 9) (<= 5 (+ v_main_~j~0_381 (* 15 v_main_~i~0_146) (* v_itHalf_15 45) .cse8 .cse9)) (< (+ v_main_~j~0_381 (* 7 v_main_~i~0_146) .cse8 .cse9 (* v_itHalf_15 29)) 13) (< (+ v_main_~j~0_381 (* v_itHalf_15 43) (* 14 v_main_~i~0_146) .cse8 .cse9) 6) (< (+ v_main_~j~0_381 (* 10 v_main_~i~0_146) .cse8 .cse9 (* v_itHalf_15 35)) 10) (< (+ v_main_~j~0_381 .cse8 (* 2 v_main_~i~0_146) (* 19 v_itHalf_15) .cse9) 18) (< (+ v_main_~j~0_381 .cse8 (* 13 v_main_~i~0_146) (* 41 v_itHalf_15) .cse9) 7) (< (+ v_main_~j~0_381 (* 3 v_main_~i~0_146) .cse8 (* v_itHalf_15 21) .cse9) 17) (< (+ (* v_itHalf_15 27) v_main_~j~0_381 .cse8 (* 6 v_main_~i~0_146) .cse9) 14) (<= (+ (* v_itHalf_15 2) v_main_~i~0_146) 100))) (not (<= v_itHalf_15 (div (+ (- 1) (* (- 1) v_main_~i~0_146) v_main_~i~0_145) 2))))) (<= 0 .cse6) .cse3 (= (mod (+ v_main_~i~0_146 v_main_~i~0_145 1) 2) 0)))))) InVars {main_~i~0=v_main_~i~0_146, main_~k~0=v_main_~k~0_72, main_~j~0=v_main_~j~0_381} OutVars{main_~i~0=v_main_~i~0_145, main_~k~0=v_main_~k~0_71, main_~j~0=v_main_~j~0_366} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {3658#(<= main_~i~0 0)} is VALID [2022-04-15 06:17:12,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {3658#(<= main_~i~0 0)} [108] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {3635#false} is VALID [2022-04-15 06:17:12,052 INFO L272 TraceCheckUtils]: 8: Hoare triple {3635#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {3635#false} is VALID [2022-04-15 06:17:12,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {3635#false} ~cond := #in~cond; {3635#false} is VALID [2022-04-15 06:17:12,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {3635#false} assume 0 == ~cond; {3635#false} is VALID [2022-04-15 06:17:12,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {3635#false} assume !false; {3635#false} is VALID [2022-04-15 06:17:12,053 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:17:12,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:17:12,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:17:12,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709510735] [2022-04-15 06:17:12,053 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:17:12,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865296397] [2022-04-15 06:17:12,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865296397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:17:12,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:17:12,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:17:12,872 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:17:12,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [97895755] [2022-04-15 06:17:12,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [97895755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:17:12,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:17:12,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 06:17:12,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253609847] [2022-04-15 06:17:12,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:17:12,874 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 2 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 30 [2022-04-15 06:17:12,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:17:12,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 2 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:17:12,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:12,901 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 06:17:12,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:17:12,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 06:17:12,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:17:12,902 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 2 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:17:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:14,451 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-15 06:17:14,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 06:17:14,451 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 2 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 30 [2022-04-15 06:17:14,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:17:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 2 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:17:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 46 transitions. [2022-04-15 06:17:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 2 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:17:14,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 46 transitions. [2022-04-15 06:17:14,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 46 transitions. [2022-04-15 06:17:14,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:14,500 INFO L225 Difference]: With dead ends: 41 [2022-04-15 06:17:14,501 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 06:17:14,501 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=344, Invalid=916, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 06:17:14,502 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:17:14,502 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:17:14,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 06:17:14,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 06:17:14,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:17:14,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 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:17:14,588 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 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:17:14,588 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 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:17:14,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:14,589 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-15 06:17:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-15 06:17:14,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:14,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:14,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 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 32 states. [2022-04-15 06:17:14,590 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 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 32 states. [2022-04-15 06:17:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:14,590 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-15 06:17:14,590 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-15 06:17:14,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:14,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:14,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:17:14,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:17:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 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:17:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-04-15 06:17:14,591 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 30 [2022-04-15 06:17:14,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:17:14,592 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-04-15 06:17:14,592 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 2 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:17:14,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2022-04-15 06:17:14,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:14,673 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-15 06:17:14,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 06:17:14,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:17:14,673 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:17:14,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 06:17:14,894 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 06:17:14,895 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:17:14,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:17:14,895 INFO L85 PathProgramCache]: Analyzing trace with hash -236785733, now seen corresponding path program 16 times [2022-04-15 06:17:14,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:17:14,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2004240721] [2022-04-15 06:17:20,117 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:17:24,443 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:17:30,958 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:17:31,262 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:17:36,076 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:17:36,084 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:17:36,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1111170170, now seen corresponding path program 1 times [2022-04-15 06:17:36,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:17:36,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656293773] [2022-04-15 06:17:36,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:17:36,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:17:36,112 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:17:36,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563488096] [2022-04-15 06:17:36,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:17:36,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:17:36,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:17:36,113 INFO L229 MonitoredProcess]: Starting monitored process 17 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:17:36,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 06:17:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:36,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:17:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:36,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:17:36,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {3931#true} call ULTIMATE.init(); {3931#true} is VALID [2022-04-15 06:17:36,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {3931#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3931#true} is VALID [2022-04-15 06:17:36,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {3931#true} assume true; {3931#true} is VALID [2022-04-15 06:17:36,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3931#true} {3931#true} #75#return; {3931#true} is VALID [2022-04-15 06:17:36,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {3931#true} call #t~ret1 := main(); {3931#true} is VALID [2022-04-15 06:17:36,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {3931#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {3951#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:17:36,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {3951#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [111] L35-3-->L29-2_primed: Formula: (let ((.cse1 (* 16 v_main_~i~0_155))) (let ((.cse7 (= v_main_~i~0_155 v_main_~i~0_154)) (.cse2 (< (+ (* 15 v_main_~i~0_155) v_main_~j~0_422) 5)) (.cse3 (<= v_main_~i~0_155 100)) (.cse6 (<= 4 (+ v_main_~j~0_422 .cse1))) (.cse8 (= v_main_~k~0_76 v_main_~k~0_75)) (.cse9 (= v_main_~j~0_422 v_main_~j~0_406))) (or (let ((.cse0 (div (+ (- 1) (* (- 1) v_main_~i~0_155) v_main_~i~0_154) 2))) (and (= v_main_~j~0_406 (+ v_main_~j~0_422 (* (* .cse0 .cse0) 32) 16 (* (* .cse0 v_main_~i~0_155) 32) (* .cse0 48) .cse1)) (<= 0 .cse0) .cse2 .cse3 (= v_main_~k~0_75 4) (forall ((v_itHalf_16 Int)) (or (let ((.cse4 (* 32 (* v_itHalf_16 v_itHalf_16))) (.cse5 (* 32 (* v_itHalf_16 v_main_~i~0_155)))) (and (< (+ v_main_~j~0_422 (* v_itHalf_16 30) .cse4 (* 7 v_main_~i~0_155) .cse5) 13) (< (+ v_main_~j~0_422 (* 8 v_main_~i~0_155) .cse4 (* v_itHalf_16 32) .cse5) 12) (< (+ v_main_~j~0_422 .cse4 (* 5 v_main_~i~0_155) .cse5 (* v_itHalf_16 26)) 15) (< (+ v_main_~j~0_422 (* v_itHalf_16 16) .cse4 .cse5) 20) (< (+ v_main_~j~0_422 .cse4 .cse5 (* v_itHalf_16 18) v_main_~i~0_155) 19) (< (+ v_main_~j~0_422 .cse4 (* 9 v_main_~i~0_155) .cse5 (* v_itHalf_16 34)) 11) (< (+ v_main_~j~0_422 (* v_itHalf_16 42) .cse4 (* 13 v_main_~i~0_155) .cse5) 7) (< (+ v_main_~j~0_422 .cse4 (* 12 v_main_~i~0_155) (* 40 v_itHalf_16) .cse5) 8) (<= (+ v_main_~i~0_155 (* v_itHalf_16 2)) 100) (< (+ v_main_~j~0_422 (* 10 v_main_~i~0_155) (* v_itHalf_16 36) .cse4 .cse5) 10) (< (+ v_main_~j~0_422 (* v_itHalf_16 38) .cse4 (* 11 v_main_~i~0_155) .cse5) 9) (<= 4 (+ v_main_~j~0_422 .cse4 (* 16 v_main_~i~0_155) .cse5 (* v_itHalf_16 48))) (< (+ (* 15 v_main_~i~0_155) v_main_~j~0_422 .cse4 (* v_itHalf_16 46) .cse5) 5) (< (+ v_main_~j~0_422 (* 14 v_main_~i~0_155) .cse4 .cse5 (* v_itHalf_16 44)) 6) (< (+ (* v_itHalf_16 20) v_main_~j~0_422 (* 2 v_main_~i~0_155) .cse4 .cse5) 18) (< (+ v_main_~j~0_422 (* v_itHalf_16 24) .cse4 (* 4 v_main_~i~0_155) .cse5) 16) (< (+ v_main_~j~0_422 (* 3 v_main_~i~0_155) .cse4 (* v_itHalf_16 22) .cse5) 17) (< (+ (* 6 v_main_~i~0_155) v_main_~j~0_422 (* v_itHalf_16 28) .cse4 .cse5) 14))) (not (<= 1 v_itHalf_16)) (not (<= v_itHalf_16 (div (+ (- 1) (* (- 1) v_main_~i~0_155) v_main_~i~0_154) 2))))) (= (mod (+ v_main_~i~0_155 v_main_~i~0_154 1) 2) 0) .cse6)) (and .cse7 .cse8 .cse9) (and .cse7 (or (not .cse2) (not .cse3) (not .cse6)) .cse8 .cse9)))) InVars {main_~i~0=v_main_~i~0_155, main_~k~0=v_main_~k~0_76, main_~j~0=v_main_~j~0_422} OutVars{main_~i~0=v_main_~i~0_154, main_~k~0=v_main_~k~0_75, main_~j~0=v_main_~j~0_406} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {3955#(<= main_~i~0 0)} is VALID [2022-04-15 06:17:36,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {3955#(<= main_~i~0 0)} [110] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {3932#false} is VALID [2022-04-15 06:17:36,986 INFO L272 TraceCheckUtils]: 8: Hoare triple {3932#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {3932#false} is VALID [2022-04-15 06:17:36,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {3932#false} ~cond := #in~cond; {3932#false} is VALID [2022-04-15 06:17:36,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {3932#false} assume 0 == ~cond; {3932#false} is VALID [2022-04-15 06:17:36,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {3932#false} assume !false; {3932#false} is VALID [2022-04-15 06:17:36,987 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:17:36,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:17:36,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:17:36,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656293773] [2022-04-15 06:17:36,987 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:17:36,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563488096] [2022-04-15 06:17:36,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563488096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:17:36,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:17:36,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:17:37,757 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:17:37,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2004240721] [2022-04-15 06:17:37,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2004240721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:17:37,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:17:37,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 06:17:37,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627842001] [2022-04-15 06:17:37,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:17:37,758 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 2 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 31 [2022-04-15 06:17:37,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:17:37,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 2 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:17:37,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:37,783 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 06:17:37,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:17:37,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 06:17:37,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2022-04-15 06:17:37,785 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 2 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:17:39,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:39,325 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-15 06:17:39,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 06:17:39,325 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 2 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 31 [2022-04-15 06:17:39,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:17:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 2 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:17:39,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. [2022-04-15 06:17:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 2 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:17:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. [2022-04-15 06:17:39,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 47 transitions. [2022-04-15 06:17:39,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:39,382 INFO L225 Difference]: With dead ends: 42 [2022-04-15 06:17:39,382 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 06:17:39,382 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=382, Invalid=1024, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 06:17:39,383 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:17:39,383 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:17:39,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 06:17:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 06:17:39,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:17:39,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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:17:39,473 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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:17:39,473 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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:17:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:39,474 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 06:17:39,474 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 06:17:39,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:39,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:39,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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 33 states. [2022-04-15 06:17:39,475 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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 33 states. [2022-04-15 06:17:39,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:39,476 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 06:17:39,476 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 06:17:39,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:39,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:39,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:17:39,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:17:39,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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:17:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-15 06:17:39,477 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31 [2022-04-15 06:17:39,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:17:39,477 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-15 06:17:39,477 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 2 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:17:39,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-15 06:17:39,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 06:17:39,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 06:17:39,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:17:39,563 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:17:39,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 06:17:39,763 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:17:39,763 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:17:39,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:17:39,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1270860556, now seen corresponding path program 17 times [2022-04-15 06:17:39,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:17:39,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2093479796] [2022-04-15 06:17:47,778 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:17:52,142 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:17:56,990 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:17:57,326 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:18:02,102 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:18:02,110 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:18:02,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1170275514, now seen corresponding path program 1 times [2022-04-15 06:18:02,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:18:02,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910562920] [2022-04-15 06:18:02,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:18:02,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:18:02,136 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:18:02,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1184829493] [2022-04-15 06:18:02,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:18:02,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:18:02,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:18:02,138 INFO L229 MonitoredProcess]: Starting monitored process 18 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:18:02,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 06:18:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:02,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:18:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:02,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:18:03,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {4237#true} call ULTIMATE.init(); {4237#true} is VALID [2022-04-15 06:18:03,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {4237#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4237#true} is VALID [2022-04-15 06:18:03,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {4237#true} assume true; {4237#true} is VALID [2022-04-15 06:18:03,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4237#true} {4237#true} #75#return; {4237#true} is VALID [2022-04-15 06:18:03,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {4237#true} call #t~ret1 := main(); {4237#true} is VALID [2022-04-15 06:18:03,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {4237#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {4257#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:18:03,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {4257#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [113] L35-3-->L29-2_primed: Formula: (let ((.cse6 (* 17 v_main_~i~0_164))) (let ((.cse0 (= v_main_~j~0_465 v_main_~j~0_448)) (.cse1 (= v_main_~i~0_164 v_main_~i~0_163)) (.cse3 (< (+ v_main_~j~0_465 (* 16 v_main_~i~0_164)) 4)) (.cse2 (<= v_main_~i~0_164 100)) (.cse4 (<= 3 (+ v_main_~j~0_465 .cse6)))) (or (and (= v_main_~k~0_80 v_main_~k~0_79) .cse0 .cse1) (and .cse0 (= v_main_~k~0_79 v_main_~k~0_80) (or (not .cse2) (not .cse3) (not .cse4)) .cse1) (let ((.cse5 (div (+ (* (- 1) v_main_~i~0_163) v_main_~i~0_164 1) (- 2)))) (and (= (+ v_main_~j~0_465 (* 51 .cse5) (* 34 (* .cse5 .cse5)) (* 34 (* .cse5 v_main_~i~0_164)) .cse6 17) v_main_~j~0_448) (= v_main_~k~0_79 4) (<= 0 .cse5) .cse3 .cse2 .cse4 (forall ((v_itHalf_17 Int)) (or (not (<= 0 v_itHalf_17)) (not (<= (+ v_itHalf_17 1) (div (+ (* (- 1) v_main_~i~0_163) v_main_~i~0_164 1) (- 2)))) (let ((.cse7 (* 34 (* v_itHalf_17 v_itHalf_17))) (.cse8 (* 34 (* v_itHalf_17 v_main_~i~0_164)))) (and (< (+ v_main_~j~0_465 .cse7 15 (* 26 v_main_~i~0_164) (* v_itHalf_17 69) .cse8) 0) (< (+ (* v_itHalf_17 65) v_main_~j~0_465 .cse7 (* v_main_~i~0_164 24) 11 .cse8) 0) (< (+ v_main_~j~0_465 29 .cse7 .cse8 (* 33 v_main_~i~0_164) (* v_itHalf_17 83)) 0) (< (+ v_main_~j~0_465 (* v_itHalf_17 79) .cse7 25 .cse8 (* 31 v_main_~i~0_164)) 0) (< (+ v_main_~j~0_465 9 .cse7 (* v_itHalf_17 63) (* 23 v_main_~i~0_164) .cse8) 0) (< (+ v_main_~j~0_465 (* v_itHalf_17 67) .cse7 (* 25 v_main_~i~0_164) 13 .cse8) 0) (<= 0 (+ (* v_itHalf_17 85) v_main_~j~0_465 (* 34 v_main_~i~0_164) 31 .cse7 .cse8)) (< (+ v_main_~j~0_465 19 (* 28 v_main_~i~0_164) .cse7 .cse8 (* v_itHalf_17 73)) 0) (< (+ v_main_~j~0_465 (* 32 v_main_~i~0_164) .cse7 .cse8 27 (* v_itHalf_17 81)) 0) (< (+ 23 v_main_~j~0_465 (* 77 v_itHalf_17) .cse7 (* 30 v_main_~i~0_164) .cse8) 0) (< (+ v_main_~j~0_465 (* v_itHalf_17 75) 21 (* 29 v_main_~i~0_164) .cse7 .cse8) 0) (< (+ (* 19 v_main_~i~0_164) (* v_itHalf_17 55) v_main_~j~0_465 .cse7 .cse8 1) 0) (< (+ v_main_~j~0_465 .cse7 (* 17 v_main_~i~0_164) (* v_itHalf_17 51) .cse8) 3) (< (+ (* v_itHalf_17 61) v_main_~j~0_465 7 (* 22 v_main_~i~0_164) .cse7 .cse8) 0) (<= (+ (* v_itHalf_17 2) v_main_~i~0_164) 99) (< (+ (* v_itHalf_17 59) v_main_~j~0_465 5 (* 21 v_main_~i~0_164) .cse7 .cse8) 0) (< (+ v_main_~j~0_465 (* 20 v_main_~i~0_164) 3 .cse7 (* v_itHalf_17 57) .cse8) 0) (< (+ v_main_~j~0_465 .cse7 (* 18 v_main_~i~0_164) .cse8 (* 53 v_itHalf_17)) 1) (< (+ v_main_~j~0_465 .cse7 17 (* v_itHalf_17 71) .cse8 (* 27 v_main_~i~0_164)) 0))))) (= (mod (+ v_main_~i~0_164 v_main_~i~0_163 1) 2) 0)))))) InVars {main_~i~0=v_main_~i~0_164, main_~k~0=v_main_~k~0_80, main_~j~0=v_main_~j~0_465} OutVars{main_~i~0=v_main_~i~0_163, main_~k~0=v_main_~k~0_79, main_~j~0=v_main_~j~0_448} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {4261#(<= main_~i~0 0)} is VALID [2022-04-15 06:18:03,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {4261#(<= main_~i~0 0)} [112] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {4238#false} is VALID [2022-04-15 06:18:03,033 INFO L272 TraceCheckUtils]: 8: Hoare triple {4238#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {4238#false} is VALID [2022-04-15 06:18:03,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {4238#false} ~cond := #in~cond; {4238#false} is VALID [2022-04-15 06:18:03,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {4238#false} assume 0 == ~cond; {4238#false} is VALID [2022-04-15 06:18:03,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {4238#false} assume !false; {4238#false} is VALID [2022-04-15 06:18:03,037 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:18:03,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:18:03,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:18:03,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910562920] [2022-04-15 06:18:03,037 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:18:03,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184829493] [2022-04-15 06:18:03,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184829493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:18:03,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:18:03,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:18:04,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:18:04,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2093479796] [2022-04-15 06:18:04,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2093479796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:18:04,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:18:04,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 06:18:04,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704204033] [2022-04-15 06:18:04,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:18:04,025 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 2 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 32 [2022-04-15 06:18:04,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:18:04,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 2 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:18:04,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:04,052 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 06:18:04,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:18:04,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 06:18:04,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:18:04,053 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 2 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:18:05,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:05,842 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-15 06:18:05,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 06:18:05,842 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 2 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 32 [2022-04-15 06:18:05,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:18:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 2 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:18:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 48 transitions. [2022-04-15 06:18:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 2 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:18:05,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 48 transitions. [2022-04-15 06:18:05,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 48 transitions. [2022-04-15 06:18:05,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:05,886 INFO L225 Difference]: With dead ends: 43 [2022-04-15 06:18:05,886 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 06:18:05,887 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=422, Invalid=1138, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 06:18:05,887 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:18:05,888 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:18:05,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 06:18:05,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 06:18:05,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:18:05,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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:18:05,979 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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:18:05,979 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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:18:05,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:05,980 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-15 06:18:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-15 06:18:05,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:18:05,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:18:05,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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 34 states. [2022-04-15 06:18:05,980 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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 34 states. [2022-04-15 06:18:05,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:05,981 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-15 06:18:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-15 06:18:05,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:18:05,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:18:05,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:18:05,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:18:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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:18:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-04-15 06:18:05,982 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 32 [2022-04-15 06:18:05,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:18:05,982 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-04-15 06:18:05,982 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 2 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:18:05,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 36 transitions. [2022-04-15 06:18:06,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-15 06:18:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 06:18:06,051 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:18:06,052 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:18:06,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 06:18:06,252 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:18:06,252 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:18:06,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:18:06,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1032558299, now seen corresponding path program 18 times [2022-04-15 06:18:06,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:18:06,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [933456321] [2022-04-15 06:18:11,391 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:18:15,658 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:18:22,620 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:18:22,919 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:18:31,892 WARN L232 SmtUtils]: Spent 7.19s on a formula simplification. DAG size of input: 351 DAG size of output: 185 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-15 06:18:31,924 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:18:31,933 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:18:31,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1229380858, now seen corresponding path program 1 times [2022-04-15 06:18:31,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:18:31,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819306129] [2022-04-15 06:18:31,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:18:31,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:18:31,956 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:18:31,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [539413960] [2022-04-15 06:18:31,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:18:31,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:18:31,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:18:31,957 INFO L229 MonitoredProcess]: Starting monitored process 19 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:18:31,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 06:18:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:31,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:18:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:32,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:18:32,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {4552#true} call ULTIMATE.init(); {4552#true} is VALID [2022-04-15 06:18:32,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {4552#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4552#true} is VALID [2022-04-15 06:18:32,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {4552#true} assume true; {4552#true} is VALID [2022-04-15 06:18:32,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4552#true} {4552#true} #75#return; {4552#true} is VALID [2022-04-15 06:18:32,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {4552#true} call #t~ret1 := main(); {4552#true} is VALID [2022-04-15 06:18:32,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {4552#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {4572#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:18:32,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {4572#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [115] L35-3-->L29-2_primed: Formula: (let ((.cse1 (* 18 v_main_~i~0_173))) (let ((.cse7 (= v_main_~k~0_84 v_main_~k~0_83)) (.cse8 (= v_main_~j~0_510 v_main_~j~0_492)) (.cse9 (= v_main_~i~0_173 v_main_~i~0_172)) (.cse5 (<= v_main_~i~0_173 100)) (.cse6 (< (+ (* 17 v_main_~i~0_173) v_main_~j~0_510) 3)) (.cse2 (<= 2 (+ v_main_~j~0_510 .cse1)))) (or (let ((.cse0 (div (+ (- 1) (* (- 1) v_main_~i~0_173) v_main_~i~0_172) 2))) (and (= (mod (+ v_main_~i~0_173 v_main_~i~0_172 1) 2) 0) (<= 0 .cse0) (= v_main_~j~0_492 (+ v_main_~j~0_510 (* (* .cse0 .cse0) 36) (* .cse0 54) (* (* .cse0 v_main_~i~0_173) 36) 18 .cse1)) (= v_main_~k~0_83 4) .cse2 (forall ((v_itHalf_18 Int)) (or (not (<= (+ v_itHalf_18 1) (div (+ (- 1) (* (- 1) v_main_~i~0_173) v_main_~i~0_172) 2))) (let ((.cse3 (* (* v_itHalf_18 v_itHalf_18) 36)) (.cse4 (* (* v_itHalf_18 v_main_~i~0_173) 36))) (and (< (+ v_main_~j~0_510 .cse3 (* 22 v_main_~i~0_173) .cse4 6 (* v_itHalf_18 62)) 0) (< (+ v_main_~j~0_510 (* 29 v_main_~i~0_173) (* 76 v_itHalf_18) .cse3 .cse4 20) 0) (< (+ v_main_~j~0_510 .cse3 .cse4 30 (* v_itHalf_18 86) (* 34 v_main_~i~0_173)) 0) (< (+ v_main_~j~0_510 .cse3 .cse4 (* 19 v_main_~i~0_173) (* 56 v_itHalf_18)) 0) (< (+ v_main_~j~0_510 (* 27 v_main_~i~0_173) .cse3 .cse4 16 (* v_itHalf_18 72)) 0) (<= 0 (+ (* 36 v_main_~i~0_173) v_main_~j~0_510 .cse3 .cse4 34 (* v_itHalf_18 90))) (< (+ (* v_itHalf_18 80) v_main_~j~0_510 .cse3 .cse4 (* 31 v_main_~i~0_173) 24) 0) (< (+ (* v_itHalf_18 74) v_main_~j~0_510 .cse3 .cse4 (* 28 v_main_~i~0_173) 18) 0) (< (+ v_main_~j~0_510 .cse3 (* v_itHalf_18 82) .cse4 (* 32 v_main_~i~0_173) 26) 0) (< (+ v_main_~j~0_510 .cse3 32 .cse4 (* 88 v_itHalf_18) (* 35 v_main_~i~0_173)) 0) (< (+ (* v_itHalf_18 78) v_main_~j~0_510 .cse3 .cse4 22 (* 30 v_main_~i~0_173)) 0) (< (+ v_main_~j~0_510 .cse3 .cse4 2 (* 20 v_main_~i~0_173) (* v_itHalf_18 58)) 0) (< (+ (* v_itHalf_18 60) v_main_~j~0_510 .cse3 .cse4 (* 21 v_main_~i~0_173) 4) 0) (< (+ v_main_~j~0_510 (* v_itHalf_18 64) .cse3 .cse4 (* 23 v_main_~i~0_173) 8) 0) (< (+ v_main_~j~0_510 (* 26 v_main_~i~0_173) (* v_itHalf_18 70) .cse3 .cse4 14) 0) (< (+ v_main_~j~0_510 .cse3 .cse4 (* 66 v_itHalf_18) (* v_main_~i~0_173 24) 10) 0) (< (+ v_main_~j~0_510 .cse3 (* v_itHalf_18 68) .cse4 (* 25 v_main_~i~0_173) 12) 0) (< (+ v_main_~j~0_510 .cse3 .cse4 (* v_itHalf_18 54) (* 18 v_main_~i~0_173)) 2) (<= (+ (* v_itHalf_18 2) v_main_~i~0_173) 99) (< (+ v_main_~j~0_510 .cse3 .cse4 (* v_itHalf_18 84) (* 33 v_main_~i~0_173) 28) 0))) (not (<= 0 v_itHalf_18)))) .cse5 .cse6)) (and .cse7 .cse8 .cse9) (and .cse7 .cse8 .cse9 (or (not .cse5) (not .cse6) (not .cse2)))))) InVars {main_~i~0=v_main_~i~0_173, main_~k~0=v_main_~k~0_84, main_~j~0=v_main_~j~0_510} OutVars{main_~i~0=v_main_~i~0_172, main_~k~0=v_main_~k~0_83, main_~j~0=v_main_~j~0_492} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {4576#(<= main_~i~0 0)} is VALID [2022-04-15 06:18:32,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {4576#(<= main_~i~0 0)} [114] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {4553#false} is VALID [2022-04-15 06:18:32,736 INFO L272 TraceCheckUtils]: 8: Hoare triple {4553#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {4553#false} is VALID [2022-04-15 06:18:32,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {4553#false} ~cond := #in~cond; {4553#false} is VALID [2022-04-15 06:18:32,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {4553#false} assume 0 == ~cond; {4553#false} is VALID [2022-04-15 06:18:32,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {4553#false} assume !false; {4553#false} is VALID [2022-04-15 06:18:32,736 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:18:32,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:18:32,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:18:32,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819306129] [2022-04-15 06:18:32,737 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:18:32,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539413960] [2022-04-15 06:18:32,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539413960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:18:32,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:18:32,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:18:33,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:18:33,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [933456321] [2022-04-15 06:18:33,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [933456321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:18:33,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:18:33,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 06:18:33,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354230415] [2022-04-15 06:18:33,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:18:33,893 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 2 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 33 [2022-04-15 06:18:33,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:18:33,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 2 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:18:33,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:33,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 06:18:33,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:18:33,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 06:18:33,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2022-04-15 06:18:33,922 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 2 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:18:36,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:36,248 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-15 06:18:36,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 06:18:36,248 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 2 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 33 [2022-04-15 06:18:36,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:18:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 2 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:18:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. [2022-04-15 06:18:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 2 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:18:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. [2022-04-15 06:18:36,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 49 transitions. [2022-04-15 06:18:36,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:36,291 INFO L225 Difference]: With dead ends: 44 [2022-04-15 06:18:36,291 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 06:18:36,291 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=464, Invalid=1258, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 06:18:36,292 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:18:36,292 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:18:36,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 06:18:36,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 06:18:36,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:18:36,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 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:18:36,399 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 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:18:36,399 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 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:18:36,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:36,400 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 06:18:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 06:18:36,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:18:36,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:18:36,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 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 35 states. [2022-04-15 06:18:36,400 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 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 35 states. [2022-04-15 06:18:36,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:36,401 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 06:18:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 06:18:36,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:18:36,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:18:36,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:18:36,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:18:36,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 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:18:36,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-04-15 06:18:36,401 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2022-04-15 06:18:36,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:18:36,402 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-04-15 06:18:36,402 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 2 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:18:36,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2022-04-15 06:18:36,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 06:18:36,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 06:18:36,492 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:18:36,492 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:18:36,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-15 06:18:36,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:18:36,696 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:18:36,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:18:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash -575901228, now seen corresponding path program 19 times [2022-04-15 06:18:36,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:18:36,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [564524314] [2022-04-15 06:18:46,447 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:18:50,747 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:19:00,863 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:19:01,120 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:19:04,418 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:19:04,427 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:19:04,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1288486202, now seen corresponding path program 1 times [2022-04-15 06:19:04,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:19:04,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25934305] [2022-04-15 06:19:04,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:19:04,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:19:04,452 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:19:04,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1766618021] [2022-04-15 06:19:04,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:19:04,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:19:04,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:19:04,453 INFO L229 MonitoredProcess]: Starting monitored process 20 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:19:04,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 06:19:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:19:04,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:19:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:19:04,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:19:05,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {4876#true} call ULTIMATE.init(); {4876#true} is VALID [2022-04-15 06:19:05,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {4876#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4876#true} is VALID [2022-04-15 06:19:05,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {4876#true} assume true; {4876#true} is VALID [2022-04-15 06:19:05,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4876#true} {4876#true} #75#return; {4876#true} is VALID [2022-04-15 06:19:05,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {4876#true} call #t~ret1 := main(); {4876#true} is VALID [2022-04-15 06:19:05,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {4876#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {4896#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:19:05,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {4896#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [117] L35-3-->L29-2_primed: Formula: (let ((.cse7 (* 19 v_main_~i~0_182))) (let ((.cse0 (= v_main_~j~0_557 v_main_~j~0_538)) (.cse1 (= v_main_~k~0_88 v_main_~k~0_87)) (.cse2 (= v_main_~i~0_182 v_main_~i~0_181)) (.cse4 (< (+ v_main_~j~0_557 (* 18 v_main_~i~0_182)) 2)) (.cse3 (<= v_main_~i~0_182 100)) (.cse5 (<= 1 (+ .cse7 v_main_~j~0_557)))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4) (not .cse5))) (and .cse0 .cse1 .cse2) (let ((.cse6 (div (+ (- 1) (* (- 1) v_main_~i~0_182) v_main_~i~0_181) 2))) (and .cse4 (= v_main_~j~0_538 (+ (* (* .cse6 v_main_~i~0_182) 38) (* (* .cse6 .cse6) 38) .cse7 v_main_~j~0_557 19 (* 57 .cse6))) (= v_main_~k~0_87 4) (<= 0 .cse6) (= (mod (+ v_main_~i~0_182 v_main_~i~0_181 1) 2) 0) (forall ((v_itHalf_19 Int)) (or (not (<= (+ v_itHalf_19 1) (div (+ (- 1) (* (- 1) v_main_~i~0_182) v_main_~i~0_181) 2))) (let ((.cse8 (* (* v_itHalf_19 v_itHalf_19) 38)) (.cse9 (* 38 (* v_itHalf_19 v_main_~i~0_182)))) (and (< (+ v_main_~j~0_557 .cse8 (* 37 v_main_~i~0_182) 35 .cse9 (* v_itHalf_19 93)) 0) (< (+ v_main_~j~0_557 .cse8 .cse9 21 (* 30 v_main_~i~0_182) (* v_itHalf_19 79)) 0) (< (+ (* v_itHalf_19 85) v_main_~j~0_557 .cse8 .cse9 27 (* 33 v_main_~i~0_182)) 0) (< (+ v_main_~j~0_557 .cse8 29 .cse9 (* v_itHalf_19 87) (* 34 v_main_~i~0_182)) 0) (< (+ (* 19 v_main_~i~0_182) v_main_~j~0_557 .cse8 .cse9 (* v_itHalf_19 57)) 1) (< (+ 23 v_main_~j~0_557 (* 31 v_main_~i~0_182) .cse8 .cse9 (* v_itHalf_19 81)) 0) (< (+ (* 23 v_main_~i~0_182) v_main_~j~0_557 7 .cse8 .cse9 (* v_itHalf_19 65)) 0) (< (+ v_main_~j~0_557 .cse8 .cse9 (* 27 v_main_~i~0_182) (* v_itHalf_19 73) 15) 0) (< (+ (* 32 v_main_~i~0_182) v_main_~j~0_557 .cse8 .cse9 (* v_itHalf_19 83) 25) 0) (< (+ v_main_~j~0_557 .cse8 .cse9 (* v_itHalf_19 69) 11 (* 25 v_main_~i~0_182)) 0) (< (+ (* 35 v_main_~i~0_182) v_main_~j~0_557 .cse8 .cse9 31 (* v_itHalf_19 89)) 0) (<= (+ (* v_itHalf_19 2) v_main_~i~0_182) 99) (< (+ (* v_itHalf_19 61) v_main_~j~0_557 .cse8 .cse9 3 (* 21 v_main_~i~0_182)) 0) (< (+ v_main_~j~0_557 .cse8 .cse9 (* 26 v_main_~i~0_182) 13 (* v_itHalf_19 71)) 0) (< (+ (* 20 v_main_~i~0_182) v_main_~j~0_557 .cse8 .cse9 (* v_itHalf_19 59) 1) 0) (<= 0 (+ v_main_~j~0_557 (* 38 v_main_~i~0_182) .cse8 .cse9 37 (* v_itHalf_19 95))) (< (+ v_main_~j~0_557 (* 36 v_main_~i~0_182) .cse8 .cse9 (* 91 v_itHalf_19) 33) 0) (< (+ v_main_~j~0_557 .cse8 .cse9 9 (* v_main_~i~0_182 24) (* v_itHalf_19 67)) 0) (< (+ v_main_~j~0_557 (* v_itHalf_19 75) .cse8 .cse9 (* 28 v_main_~i~0_182) 17) 0) (< (+ v_main_~j~0_557 (* 22 v_main_~i~0_182) .cse8 5 .cse9 (* v_itHalf_19 63)) 0) (< (+ v_main_~j~0_557 19 (* 77 v_itHalf_19) .cse8 .cse9 (* 29 v_main_~i~0_182)) 0))) (not (<= 0 v_itHalf_19)))) .cse3 .cse5))))) InVars {main_~i~0=v_main_~i~0_182, main_~k~0=v_main_~k~0_88, main_~j~0=v_main_~j~0_557} OutVars{main_~i~0=v_main_~i~0_181, main_~k~0=v_main_~k~0_87, main_~j~0=v_main_~j~0_538} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {4900#(<= main_~i~0 0)} is VALID [2022-04-15 06:19:05,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {4900#(<= main_~i~0 0)} [116] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {4877#false} is VALID [2022-04-15 06:19:05,291 INFO L272 TraceCheckUtils]: 8: Hoare triple {4877#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {4877#false} is VALID [2022-04-15 06:19:05,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {4877#false} ~cond := #in~cond; {4877#false} is VALID [2022-04-15 06:19:05,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {4877#false} assume 0 == ~cond; {4877#false} is VALID [2022-04-15 06:19:05,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {4877#false} assume !false; {4877#false} is VALID [2022-04-15 06:19:05,292 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:19:05,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:19:05,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:19:05,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25934305] [2022-04-15 06:19:05,292 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:19:05,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766618021] [2022-04-15 06:19:05,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766618021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:19:05,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:19:05,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:19:06,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:19:06,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [564524314] [2022-04-15 06:19:06,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [564524314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:19:06,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:19:06,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 06:19:06,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762403780] [2022-04-15 06:19:06,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:19:06,616 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 2 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 34 [2022-04-15 06:19:06,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:19:06,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 2 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:19:06,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:19:06,649 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 06:19:06,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:19:06,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 06:19:06,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2022-04-15 06:19:06,650 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 2 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:19:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:19:09,408 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-15 06:19:09,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 06:19:09,408 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 2 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 34 [2022-04-15 06:19:09,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:19:09,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 2 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:19:09,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 50 transitions. [2022-04-15 06:19:09,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 2 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:19:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 50 transitions. [2022-04-15 06:19:09,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 50 transitions. [2022-04-15 06:19:09,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:19:09,462 INFO L225 Difference]: With dead ends: 45 [2022-04-15 06:19:09,462 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 06:19:09,462 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=508, Invalid=1384, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 06:19:09,463 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:19:09,463 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:19:09,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 06:19:09,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 06:19:09,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:19:09,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 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:19:09,574 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 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:19:09,574 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 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:19:09,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:19:09,575 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-15 06:19:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 06:19:09,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:19:09,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:19:09,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 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 36 states. [2022-04-15 06:19:09,575 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 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 36 states. [2022-04-15 06:19:09,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:19:09,576 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-15 06:19:09,576 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 06:19:09,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:19:09,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:19:09,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:19:09,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:19:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 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:19:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-15 06:19:09,576 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 34 [2022-04-15 06:19:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:19:09,577 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-15 06:19:09,577 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 2 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:19:09,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-15 06:19:09,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:19:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 06:19:09,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 06:19:09,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:19:09,691 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:19:09,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-15 06:19:09,891 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:19:09,891 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:19:09,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:19:09,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1101460987, now seen corresponding path program 20 times [2022-04-15 06:19:09,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:19:09,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1176355132] [2022-04-15 06:19:10,050 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:19:14,384 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:19:20,359 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:19:20,846 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:19:29,378 WARN L232 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 376 DAG size of output: 179 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-15 06:19:29,413 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:19:29,422 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:19:29,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1347591546, now seen corresponding path program 1 times [2022-04-15 06:19:29,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:19:29,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223345924] [2022-04-15 06:19:29,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:19:29,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:19:29,454 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:19:29,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1700540287] [2022-04-15 06:19:29,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:19:29,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:19:29,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:19:29,455 INFO L229 MonitoredProcess]: Starting monitored process 21 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:19:29,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 06:19:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:19:29,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:19:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:19:29,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:19:30,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {5209#true} call ULTIMATE.init(); {5209#true} is VALID [2022-04-15 06:19:30,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {5209#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5209#true} is VALID [2022-04-15 06:19:30,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {5209#true} assume true; {5209#true} is VALID [2022-04-15 06:19:30,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5209#true} {5209#true} #75#return; {5209#true} is VALID [2022-04-15 06:19:30,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {5209#true} call #t~ret1 := main(); {5209#true} is VALID [2022-04-15 06:19:30,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {5209#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {5229#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:19:30,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {5229#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [119] L35-3-->L29-2_primed: Formula: (let ((.cse7 (* 20 v_main_~i~0_191))) (let ((.cse0 (= v_main_~i~0_191 v_main_~i~0_190)) (.cse1 (= v_main_~k~0_92 v_main_~k~0_91)) (.cse2 (= v_main_~j~0_606 v_main_~j~0_586)) (.cse5 (< (+ (* 19 v_main_~i~0_191) v_main_~j~0_606) 1)) (.cse3 (<= v_main_~i~0_191 100)) (.cse4 (<= 0 (+ v_main_~j~0_606 .cse7)))) (or (and .cse0 .cse1 .cse2) (and .cse0 (or (not .cse3) (not .cse4) (not .cse5)) .cse1 .cse2) (let ((.cse6 (div (+ (- 1) (* (- 1) v_main_~i~0_191) v_main_~i~0_190) 2))) (and (<= 0 .cse6) (= v_main_~j~0_586 (+ v_main_~j~0_606 (* 40 (* .cse6 .cse6)) (* 60 .cse6) (* 40 (* .cse6 v_main_~i~0_191)) 20 .cse7)) .cse5 (= (mod (+ v_main_~i~0_191 v_main_~i~0_190 1) 2) 0) (= v_main_~k~0_91 4) .cse3 (forall ((v_itHalf_20 Int)) (or (let ((.cse8 (* (* v_itHalf_20 v_main_~i~0_191) 40)) (.cse9 (* (* v_itHalf_20 v_itHalf_20) 40))) (and (< (+ .cse8 v_main_~j~0_606 (* 5 v_main_~i~0_191) .cse9 (* v_itHalf_20 30)) 15) (< (+ .cse8 v_main_~j~0_606 .cse9 (* v_itHalf_20 20)) 20) (<= 0 (+ .cse8 v_main_~j~0_606 .cse9 (* v_itHalf_20 60) (* 20 v_main_~i~0_191))) (< (+ (* v_itHalf_20 52) .cse8 v_main_~j~0_606 (* 16 v_main_~i~0_191) .cse9) 4) (< (+ .cse8 v_main_~j~0_606 .cse9 (* v_itHalf_20 46) (* 13 v_main_~i~0_191)) 7) (< (+ .cse8 v_main_~j~0_606 (* 40 v_itHalf_20) (* 10 v_main_~i~0_191) .cse9) 10) (< (+ .cse8 v_main_~j~0_606 (* 9 v_main_~i~0_191) .cse9 (* v_itHalf_20 38)) 11) (< (+ .cse8 v_main_~j~0_606 (* v_itHalf_20 54) (* 17 v_main_~i~0_191) .cse9) 3) (< (+ .cse8 (* 56 v_itHalf_20) v_main_~j~0_606 (* 18 v_main_~i~0_191) .cse9) 2) (< (+ (* v_itHalf_20 44) .cse8 v_main_~j~0_606 (* 12 v_main_~i~0_191) .cse9) 8) (< (+ .cse8 (* 14 v_main_~i~0_191) v_main_~j~0_606 (* v_itHalf_20 48) .cse9) 6) (< (+ .cse8 v_main_~j~0_606 (* 2 v_main_~i~0_191) (* v_itHalf_20 24) .cse9) 18) (<= (+ (* v_itHalf_20 2) v_main_~i~0_191) 100) (< (+ .cse8 (* 6 v_main_~i~0_191) v_main_~j~0_606 .cse9 (* v_itHalf_20 32)) 14) (< (+ .cse8 v_main_~j~0_606 (* v_itHalf_20 42) .cse9 (* 11 v_main_~i~0_191)) 9) (< (+ .cse8 v_main_~j~0_606 (* v_itHalf_20 22) .cse9 v_main_~i~0_191) 19) (< (+ .cse8 v_main_~j~0_606 (* v_itHalf_20 26) .cse9 (* 3 v_main_~i~0_191)) 17) (< (+ .cse8 v_main_~j~0_606 (* 4 v_main_~i~0_191) .cse9 (* v_itHalf_20 28)) 16) (< (+ (* v_itHalf_20 58) .cse8 (* 19 v_main_~i~0_191) v_main_~j~0_606 .cse9) 1) (< (+ .cse8 v_main_~j~0_606 (* 15 v_main_~i~0_191) (* v_itHalf_20 50) .cse9) 5) (< (+ (* v_itHalf_20 34) .cse8 v_main_~j~0_606 .cse9 (* 7 v_main_~i~0_191)) 13) (< (+ .cse8 v_main_~j~0_606 (* v_itHalf_20 36) .cse9 (* 8 v_main_~i~0_191)) 12))) (not (<= v_itHalf_20 (div (+ (- 1) (* (- 1) v_main_~i~0_191) v_main_~i~0_190) 2))) (not (<= 1 v_itHalf_20)))) .cse4))))) InVars {main_~i~0=v_main_~i~0_191, main_~k~0=v_main_~k~0_92, main_~j~0=v_main_~j~0_606} OutVars{main_~i~0=v_main_~i~0_190, main_~k~0=v_main_~k~0_91, main_~j~0=v_main_~j~0_586} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {5233#(<= main_~i~0 0)} is VALID [2022-04-15 06:19:30,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {5233#(<= main_~i~0 0)} [118] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {5210#false} is VALID [2022-04-15 06:19:30,211 INFO L272 TraceCheckUtils]: 8: Hoare triple {5210#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {5210#false} is VALID [2022-04-15 06:19:30,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {5210#false} ~cond := #in~cond; {5210#false} is VALID [2022-04-15 06:19:30,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {5210#false} assume 0 == ~cond; {5210#false} is VALID [2022-04-15 06:19:30,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {5210#false} assume !false; {5210#false} is VALID [2022-04-15 06:19:30,212 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:19:30,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:19:30,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:19:30,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223345924] [2022-04-15 06:19:30,212 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:19:30,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700540287] [2022-04-15 06:19:30,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700540287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:19:30,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:19:30,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:19:32,015 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:19:32,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1176355132] [2022-04-15 06:19:32,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1176355132] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:19:32,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:19:32,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 06:19:32,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161951979] [2022-04-15 06:19:32,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:19:32,015 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (3), 2 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 35 [2022-04-15 06:19:32,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:19:32,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (3), 2 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:19:32,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:19:32,049 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 06:19:32,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:19:32,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 06:19:32,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2022-04-15 06:19:32,050 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (3), 2 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:19:35,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:19:35,419 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-15 06:19:35,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 06:19:35,419 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (3), 2 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 35 [2022-04-15 06:19:35,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:19:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (3), 2 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:19:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 51 transitions. [2022-04-15 06:19:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (3), 2 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:19:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 51 transitions. [2022-04-15 06:19:35,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 51 transitions. [2022-04-15 06:19:35,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:19:35,478 INFO L225 Difference]: With dead ends: 46 [2022-04-15 06:19:35,478 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 06:19:35,479 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=554, Invalid=1516, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 06:19:35,480 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:19:35,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:19:35,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 06:19:35,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 06:19:35,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:19:35,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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:19:35,598 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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:19:35,598 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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:19:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:19:35,598 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 06:19:35,598 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 06:19:35,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:19:35,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:19:35,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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 37 states. [2022-04-15 06:19:35,599 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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 37 states. [2022-04-15 06:19:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:19:35,599 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 06:19:35,599 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 06:19:35,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:19:35,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:19:35,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:19:35,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:19:35,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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:19:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-15 06:19:35,600 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 35 [2022-04-15 06:19:35,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:19:35,600 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-15 06:19:35,600 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (3), 2 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:19:35,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-15 06:19:35,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:19:35,737 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 06:19:35,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 06:19:35,737 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:19:35,738 INFO L499 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:19:35,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-15 06:19:35,938 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-15 06:19:35,939 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:19:35,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:19:35,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1560082100, now seen corresponding path program 21 times [2022-04-15 06:19:35,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:19:35,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1055020341] [2022-04-15 06:19:40,349 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:19:44,650 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:19:48,218 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:19:48,562 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:19:52,276 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:19:52,286 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:19:52,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1406696890, now seen corresponding path program 1 times [2022-04-15 06:19:52,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:19:52,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426917956] [2022-04-15 06:19:52,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:19:52,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:19:52,314 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:19:52,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1916680235] [2022-04-15 06:19:52,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:19:52,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:19:52,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:19:52,315 INFO L229 MonitoredProcess]: Starting monitored process 22 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:19:52,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 06:19:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:19:52,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:19:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:19:52,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:19:53,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {5551#true} call ULTIMATE.init(); {5551#true} is VALID [2022-04-15 06:19:53,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {5551#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5551#true} is VALID [2022-04-15 06:19:53,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {5551#true} assume true; {5551#true} is VALID [2022-04-15 06:19:53,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5551#true} {5551#true} #75#return; {5551#true} is VALID [2022-04-15 06:19:53,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {5551#true} call #t~ret1 := main(); {5551#true} is VALID [2022-04-15 06:19:53,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {5551#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {5571#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:19:53,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {5571#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [121] L35-3-->L29-2_primed: Formula: (let ((.cse4 (* 21 v_main_~i~0_200))) (let ((.cse2 (< (+ v_main_~j~0_657 (* 20 v_main_~i~0_200)) 0)) (.cse8 (<= v_main_~i~0_200 100)) (.cse3 (<= 0 (+ v_main_~j~0_657 .cse4 1))) (.cse0 (= v_main_~i~0_200 v_main_~i~0_199)) (.cse1 (= v_main_~j~0_657 v_main_~j~0_636))) (or (and .cse0 .cse1 (= v_main_~k~0_96 v_main_~k~0_95)) (let ((.cse5 (div (+ (- 1) (* (- 1) v_main_~i~0_200) v_main_~i~0_199) 2))) (and (= 0 (mod (+ v_main_~i~0_200 v_main_~i~0_199 1) 2)) .cse2 .cse3 (= v_main_~k~0_95 4) (= v_main_~j~0_636 (+ v_main_~j~0_657 .cse4 (* 42 (* .cse5 v_main_~i~0_200)) 21 (* .cse5 63) (* (* .cse5 .cse5) 42))) (forall ((v_itHalf_21 Int)) (or (let ((.cse6 (* 42 (* v_itHalf_21 v_main_~i~0_200))) (.cse7 (* (* v_itHalf_21 v_itHalf_21) 42))) (and (< (+ (* v_itHalf_21 65) v_main_~j~0_657 .cse6 3 (* 22 v_main_~i~0_200) .cse7) 0) (<= 0 (+ v_main_~j~0_657 .cse6 (* v_itHalf_21 105) 43 (* 42 v_main_~i~0_200) .cse7)) (< (+ v_main_~j~0_657 .cse6 (* v_itHalf_21 99) (* 39 v_main_~i~0_200) 37 .cse7) 0) (< (+ v_main_~j~0_657 .cse6 (* v_itHalf_21 73) (* 26 v_main_~i~0_200) 11 .cse7) 0) (< (+ v_main_~j~0_657 .cse6 (* 91 v_itHalf_21) 29 (* 35 v_main_~i~0_200) .cse7) 0) (< (+ v_main_~j~0_657 .cse6 (* 31 v_main_~i~0_200) 21 (* v_itHalf_21 83) .cse7) 0) (< (+ v_main_~j~0_657 .cse6 33 (* 37 v_main_~i~0_200) (* v_itHalf_21 95) .cse7) 0) (< (+ v_main_~j~0_657 (* 21 v_main_~i~0_200) .cse6 (* v_itHalf_21 63) 1 .cse7) 0) (< (+ v_main_~j~0_657 .cse6 (* 34 v_main_~i~0_200) (* v_itHalf_21 89) 27 .cse7) 0) (< (+ v_main_~j~0_657 .cse6 (* v_itHalf_21 97) 35 (* 38 v_main_~i~0_200) .cse7) 0) (< (+ v_main_~j~0_657 .cse6 5 (* 23 v_main_~i~0_200) (* v_itHalf_21 67) .cse7) 0) (< (+ v_main_~j~0_657 .cse6 (* v_itHalf_21 87) (* 33 v_main_~i~0_200) 25 .cse7) 0) (< (+ 23 v_main_~j~0_657 .cse6 (* 32 v_main_~i~0_200) (* v_itHalf_21 85) .cse7) 0) (< (+ v_main_~j~0_657 .cse6 7 (* v_main_~i~0_200 24) (* v_itHalf_21 69) .cse7) 0) (< (+ (* v_itHalf_21 81) v_main_~j~0_657 19 .cse6 (* 30 v_main_~i~0_200) .cse7) 0) (< (+ (* 101 v_itHalf_21) v_main_~j~0_657 .cse6 (* 40 v_main_~i~0_200) 39 .cse7) 0) (< (+ v_main_~j~0_657 .cse6 (* 27 v_main_~i~0_200) 13 (* v_itHalf_21 75) .cse7) 0) (< (+ 41 (* 41 v_main_~i~0_200) v_main_~j~0_657 .cse6 (* v_itHalf_21 103) .cse7) 0) (< (+ v_main_~j~0_657 .cse6 (* 25 v_main_~i~0_200) 9 (* v_itHalf_21 71) .cse7) 0) (< (+ (* v_itHalf_21 79) v_main_~j~0_657 .cse6 (* 29 v_main_~i~0_200) 17 .cse7) 0) (< (+ (* 28 v_main_~i~0_200) v_main_~j~0_657 .cse6 15 (* 77 v_itHalf_21) .cse7) 0) (< (+ (* 36 v_main_~i~0_200) v_main_~j~0_657 .cse6 (* v_itHalf_21 93) 31 .cse7) 0) (<= (+ (* v_itHalf_21 2) v_main_~i~0_200) 99))) (not (<= (+ v_itHalf_21 1) (div (+ (- 1) (* (- 1) v_main_~i~0_200) v_main_~i~0_199) 2))) (not (<= 0 v_itHalf_21)))) (<= 0 .cse5) .cse8)) (and (= v_main_~k~0_95 v_main_~k~0_96) (or (not .cse2) (not .cse8) (not .cse3)) .cse0 .cse1)))) InVars {main_~i~0=v_main_~i~0_200, main_~k~0=v_main_~k~0_96, main_~j~0=v_main_~j~0_657} OutVars{main_~i~0=v_main_~i~0_199, main_~k~0=v_main_~k~0_95, main_~j~0=v_main_~j~0_636} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {5575#(<= main_~i~0 0)} is VALID [2022-04-15 06:19:53,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {5575#(<= main_~i~0 0)} [120] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {5552#false} is VALID [2022-04-15 06:19:53,354 INFO L272 TraceCheckUtils]: 8: Hoare triple {5552#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {5552#false} is VALID [2022-04-15 06:19:53,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {5552#false} ~cond := #in~cond; {5552#false} is VALID [2022-04-15 06:19:53,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {5552#false} assume 0 == ~cond; {5552#false} is VALID [2022-04-15 06:19:53,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {5552#false} assume !false; {5552#false} is VALID [2022-04-15 06:19:53,359 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:19:53,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:19:53,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:19:53,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426917956] [2022-04-15 06:19:53,359 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:19:53,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916680235] [2022-04-15 06:19:53,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916680235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:19:53,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:19:53,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:19:55,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:19:55,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1055020341] [2022-04-15 06:19:55,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1055020341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:19:55,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:19:55,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 06:19:55,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008262404] [2022-04-15 06:19:55,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:19:55,460 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 2 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 36 [2022-04-15 06:19:55,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:19:55,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 2 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:19:55,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:19:55,495 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 06:19:55,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:19:55,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 06:19:55,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:19:55,496 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 2 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:19:59,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:19:59,434 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-15 06:19:59,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 06:19:59,434 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 2 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 36 [2022-04-15 06:19:59,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:19:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 2 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:19:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2022-04-15 06:19:59,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 2 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:19:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2022-04-15 06:19:59,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 52 transitions. [2022-04-15 06:19:59,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:19:59,494 INFO L225 Difference]: With dead ends: 47 [2022-04-15 06:19:59,494 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 06:19:59,495 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=602, Invalid=1654, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 06:19:59,495 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:19:59,495 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:19:59,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 06:19:59,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 06:19:59,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:19:59,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 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:19:59,623 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 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:19:59,623 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 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:19:59,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:19:59,623 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-15 06:19:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 06:19:59,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:19:59,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:19:59,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 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 38 states. [2022-04-15 06:19:59,624 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 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 38 states. [2022-04-15 06:19:59,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:19:59,624 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-15 06:19:59,624 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 06:19:59,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:19:59,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:19:59,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:19:59,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:19:59,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 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:19:59,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-04-15 06:19:59,625 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 36 [2022-04-15 06:19:59,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:19:59,625 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-04-15 06:19:59,625 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 2 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:19:59,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 40 transitions. [2022-04-15 06:19:59,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:19:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 06:19:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 06:19:59,777 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:19:59,777 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:19:59,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 06:19:59,977 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-15 06:19:59,978 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:19:59,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:19:59,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1402532581, now seen corresponding path program 22 times [2022-04-15 06:19:59,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:19:59,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [863925408] [2022-04-15 06:20:06,472 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:20:10,860 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:20:21,922 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:20:22,314 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:20:26,433 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:20:26,442 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:20:26,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1465802234, now seen corresponding path program 1 times [2022-04-15 06:20:26,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:20:26,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443691701] [2022-04-15 06:20:26,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:20:26,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:20:26,466 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:20:26,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [18384836] [2022-04-15 06:20:26,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:20:26,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:20:26,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:20:26,467 INFO L229 MonitoredProcess]: Starting monitored process 23 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:20:26,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 06:20:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:20:26,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:20:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:20:26,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:20:27,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {5902#true} call ULTIMATE.init(); {5902#true} is VALID [2022-04-15 06:20:27,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {5902#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5902#true} is VALID [2022-04-15 06:20:27,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {5902#true} assume true; {5902#true} is VALID [2022-04-15 06:20:27,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5902#true} {5902#true} #75#return; {5902#true} is VALID [2022-04-15 06:20:27,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {5902#true} call #t~ret1 := main(); {5902#true} is VALID [2022-04-15 06:20:27,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {5902#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {5922#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:20:27,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {5922#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [123] L35-3-->L29-2_primed: Formula: (let ((.cse6 (* 22 v_main_~i~0_209))) (let ((.cse0 (= v_main_~i~0_209 v_main_~i~0_208)) (.cse1 (= v_main_~j~0_710 v_main_~j~0_688)) (.cse3 (<= v_main_~i~0_209 100)) (.cse4 (<= 0 (+ v_main_~j~0_710 .cse6 2))) (.cse2 (< (+ v_main_~j~0_710 (* 21 v_main_~i~0_209) 1) 0))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3) (not .cse4)) (= v_main_~k~0_99 v_main_~k~0_100)) (and .cse0 .cse1 (= v_main_~k~0_100 v_main_~k~0_99)) (let ((.cse5 (div (+ (* (- 1) v_main_~i~0_209) (- 1) v_main_~i~0_208) 2))) (and (= v_main_~j~0_688 (+ (* 44 (* .cse5 v_main_~i~0_209)) v_main_~j~0_710 .cse6 (* 66 .cse5) (* (* .cse5 .cse5) 44) 22)) (= (mod (+ v_main_~i~0_209 v_main_~i~0_208 1) 2) 0) .cse3 (forall ((v_itHalf_22 Int)) (or (not (<= (+ v_itHalf_22 1) (div (+ (* (- 1) v_main_~i~0_209) (- 1) v_main_~i~0_208) 2))) (let ((.cse7 (* (* v_itHalf_22 v_itHalf_22) 44)) (.cse8 (* (* v_itHalf_22 v_main_~i~0_209) 44))) (and (< (+ v_main_~j~0_710 (* 39 v_main_~i~0_209) (* v_itHalf_22 100) .cse7 36 .cse8) 0) (<= (+ v_main_~i~0_209 (* v_itHalf_22 2)) 99) (< (+ v_main_~j~0_710 (* v_itHalf_22 82) .cse7 18 .cse8 (* 30 v_main_~i~0_209)) 0) (< (+ v_main_~j~0_710 42 .cse7 (* 106 v_itHalf_22) (* 42 v_main_~i~0_209) .cse8) 0) (< (+ (* 66 v_itHalf_22) v_main_~j~0_710 (* 22 v_main_~i~0_209) 2 .cse7 .cse8) 0) (< (+ v_main_~j~0_710 14 .cse7 (* 28 v_main_~i~0_209) .cse8 (* v_itHalf_22 78)) 0) (< (+ (* 88 v_itHalf_22) v_main_~j~0_710 (* 33 v_main_~i~0_209) .cse7 .cse8 24) 0) (< (+ (* v_itHalf_22 94) v_main_~j~0_710 30 .cse7 .cse8 (* 36 v_main_~i~0_209)) 0) (< (+ v_main_~j~0_710 6 .cse7 (* v_itHalf_22 70) .cse8 (* v_main_~i~0_209 24)) 0) (< (+ (* v_itHalf_22 80) v_main_~j~0_710 16 .cse7 .cse8 (* 29 v_main_~i~0_209)) 0) (< (+ v_main_~j~0_710 40 (* v_itHalf_22 104) (* 41 v_main_~i~0_209) .cse7 .cse8) 0) (< (+ v_main_~j~0_710 32 (* v_itHalf_22 96) .cse7 (* 37 v_main_~i~0_209) .cse8) 0) (< (+ (* 92 v_itHalf_22) v_main_~j~0_710 .cse7 28 .cse8 (* 35 v_main_~i~0_209)) 0) (< (+ v_main_~j~0_710 (* 76 v_itHalf_22) (* 27 v_main_~i~0_209) .cse7 12 .cse8) 0) (< (+ v_main_~j~0_710 (* v_itHalf_22 98) 34 .cse7 .cse8 (* 38 v_main_~i~0_209)) 0) (< (+ (* v_itHalf_22 108) v_main_~j~0_710 44 .cse7 (* 43 v_main_~i~0_209) .cse8) 0) (< (+ v_main_~j~0_710 (* v_itHalf_22 68) .cse7 4 .cse8 (* 23 v_main_~i~0_209)) 0) (< (+ v_main_~j~0_710 (* v_itHalf_22 72) .cse7 8 (* 25 v_main_~i~0_209) .cse8) 0) (< (+ (* v_itHalf_22 74) v_main_~j~0_710 .cse7 (* 26 v_main_~i~0_209) .cse8 10) 0) (<= 0 (+ v_main_~j~0_710 (* v_itHalf_22 110) (* 44 v_main_~i~0_209) 46 .cse7 .cse8)) (< (+ v_main_~j~0_710 (* 31 v_main_~i~0_209) .cse7 (* v_itHalf_22 84) 20 .cse8) 0) (< (+ (* v_itHalf_22 102) v_main_~j~0_710 (* 40 v_main_~i~0_209) .cse7 38 .cse8) 0) (< (+ v_main_~j~0_710 22 (* 32 v_main_~i~0_209) .cse7 (* v_itHalf_22 86) .cse8) 0) (< (+ v_main_~j~0_710 (* v_itHalf_22 90) .cse7 26 (* 34 v_main_~i~0_209) .cse8) 0))) (not (<= 0 v_itHalf_22)))) .cse4 .cse2 (= v_main_~k~0_99 4) (<= 0 .cse5)))))) InVars {main_~i~0=v_main_~i~0_209, main_~k~0=v_main_~k~0_100, main_~j~0=v_main_~j~0_710} OutVars{main_~i~0=v_main_~i~0_208, main_~k~0=v_main_~k~0_99, main_~j~0=v_main_~j~0_688} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {5926#(<= main_~i~0 0)} is VALID [2022-04-15 06:20:27,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {5926#(<= main_~i~0 0)} [122] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {5903#false} is VALID [2022-04-15 06:20:27,543 INFO L272 TraceCheckUtils]: 8: Hoare triple {5903#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {5903#false} is VALID [2022-04-15 06:20:27,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {5903#false} ~cond := #in~cond; {5903#false} is VALID [2022-04-15 06:20:27,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {5903#false} assume 0 == ~cond; {5903#false} is VALID [2022-04-15 06:20:27,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {5903#false} assume !false; {5903#false} is VALID [2022-04-15 06:20:27,543 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:20:27,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:20:27,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:20:27,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443691701] [2022-04-15 06:20:27,543 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:20:27,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18384836] [2022-04-15 06:20:27,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18384836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:20:27,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:20:27,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:20:30,004 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:20:30,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [863925408] [2022-04-15 06:20:30,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [863925408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:20:30,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:20:30,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 06:20:30,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675426008] [2022-04-15 06:20:30,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:20:30,005 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 2 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 37 [2022-04-15 06:20:30,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:20:30,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 2 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:20:30,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:20:30,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 06:20:30,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:20:30,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 06:20:30,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2022-04-15 06:20:30,045 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 2 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:20:34,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:20:34,769 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-15 06:20:34,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 06:20:34,769 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 2 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 37 [2022-04-15 06:20:34,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:20:34,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 2 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:20:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 53 transitions. [2022-04-15 06:20:34,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 2 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:20:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 53 transitions. [2022-04-15 06:20:34,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 53 transitions. [2022-04-15 06:20:34,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:20:34,835 INFO L225 Difference]: With dead ends: 48 [2022-04-15 06:20:34,835 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 06:20:34,835 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=652, Invalid=1798, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 06:20:34,836 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:20:34,836 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:20:34,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 06:20:34,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 06:20:34,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:20:34,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 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:20:34,979 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 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:20:34,979 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 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:20:34,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:20:34,979 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 06:20:34,979 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 06:20:34,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:20:34,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:20:34,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 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 39 states. [2022-04-15 06:20:34,980 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 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 39 states. [2022-04-15 06:20:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:20:34,980 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 06:20:34,980 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 06:20:34,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:20:34,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:20:34,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:20:34,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:20:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 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:20:34,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-04-15 06:20:34,981 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 37 [2022-04-15 06:20:34,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:20:34,981 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-04-15 06:20:34,982 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 2 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:20:34,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2022-04-15 06:20:35,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:20:35,169 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 06:20:35,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 06:20:35,170 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:20:35,170 INFO L499 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:20:35,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 06:20:35,370 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:20:35,370 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:20:35,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:20:35,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1245692820, now seen corresponding path program 23 times [2022-04-15 06:20:35,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:20:35,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1126395220] [2022-04-15 06:20:43,644 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:20:48,069 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:20:55,183 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:20:55,513 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:21:00,317 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:21:00,327 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:21:00,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1524907578, now seen corresponding path program 1 times [2022-04-15 06:21:00,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:21:00,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366680726] [2022-04-15 06:21:00,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:21:00,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:21:00,355 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:21:00,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1667882763] [2022-04-15 06:21:00,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:21:00,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:21:00,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:21:00,356 INFO L229 MonitoredProcess]: Starting monitored process 24 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:21:00,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 06:21:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:00,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:21:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:00,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:21:01,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {6262#true} call ULTIMATE.init(); {6262#true} is VALID [2022-04-15 06:21:01,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {6262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6262#true} is VALID [2022-04-15 06:21:01,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {6262#true} assume true; {6262#true} is VALID [2022-04-15 06:21:01,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6262#true} {6262#true} #75#return; {6262#true} is VALID [2022-04-15 06:21:01,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {6262#true} call #t~ret1 := main(); {6262#true} is VALID [2022-04-15 06:21:01,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {6262#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {6282#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:21:01,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {6282#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [125] L35-3-->L29-2_primed: Formula: (let ((.cse9 (* 23 v_main_~i~0_218))) (let ((.cse0 (= v_main_~j~0_765 v_main_~j~0_742)) (.cse4 (<= 0 (+ v_main_~j~0_765 .cse9 3))) (.cse3 (< (+ v_main_~j~0_765 2 (* 22 v_main_~i~0_218)) 0)) (.cse7 (<= v_main_~i~0_218 100)) (.cse1 (= v_main_~i~0_218 v_main_~i~0_217)) (.cse2 (= v_main_~k~0_104 v_main_~k~0_103))) (or (and .cse0 .cse1 .cse2) (let ((.cse8 (div (+ (- 1) (* (- 1) v_main_~i~0_218) v_main_~i~0_217) 2))) (and .cse3 .cse4 (= v_main_~k~0_103 4) (forall ((v_itHalf_23 Int)) (or (not (<= v_itHalf_23 (div (+ (- 1) (* (- 1) v_main_~i~0_218) v_main_~i~0_217) 2))) (not (<= 1 v_itHalf_23)) (let ((.cse5 (* (* v_itHalf_23 v_main_~i~0_218) 46)) (.cse6 (* (* v_itHalf_23 v_itHalf_23) 46))) (and (< (+ (* 18 v_main_~i~0_218) v_main_~j~0_765 .cse5 .cse6 (* v_itHalf_23 59)) 2) (< (+ v_main_~j~0_765 (* v_itHalf_23 27) (* 2 v_main_~i~0_218) .cse5 .cse6) 18) (< (+ v_main_~j~0_765 (* v_itHalf_23 51) (* 14 v_main_~i~0_218) .cse5 .cse6) 6) (< (+ v_main_~j~0_765 (* 53 v_itHalf_23) .cse5 (* 15 v_main_~i~0_218) .cse6) 5) (< (+ v_main_~j~0_765 2 (* 22 v_main_~i~0_218) .cse5 (* v_itHalf_23 67) .cse6) 0) (< (+ v_main_~j~0_765 (* v_itHalf_23 63) (* 20 v_main_~i~0_218) .cse5 .cse6) 0) (< (+ v_main_~j~0_765 (* v_itHalf_23 61) (* 19 v_main_~i~0_218) .cse5 .cse6) 1) (< (+ v_main_~j~0_765 (* 23 v_itHalf_23) .cse5 .cse6) 20) (< (+ (* 8 v_main_~i~0_218) v_main_~j~0_765 (* v_itHalf_23 39) .cse5 .cse6) 12) (< (+ v_main_~j~0_765 (* 11 v_main_~i~0_218) (* v_itHalf_23 45) .cse5 .cse6) 9) (< (+ v_main_~j~0_765 (* 12 v_main_~i~0_218) .cse5 (* v_itHalf_23 47) .cse6) 8) (< (+ (* v_itHalf_23 49) v_main_~j~0_765 (* 13 v_main_~i~0_218) .cse5 .cse6) 7) (< (+ v_main_~j~0_765 (* v_itHalf_23 57) (* 17 v_main_~i~0_218) .cse5 .cse6) 3) (< (+ v_main_~j~0_765 (* v_itHalf_23 43) (* 10 v_main_~i~0_218) .cse5 .cse6) 10) (< (+ v_main_~j~0_765 (* 7 v_main_~i~0_218) (* v_itHalf_23 37) .cse5 .cse6) 13) (< (+ v_main_~j~0_765 (* 16 v_main_~i~0_218) (* v_itHalf_23 55) .cse5 .cse6) 4) (< (+ (* v_itHalf_23 35) v_main_~j~0_765 (* 6 v_main_~i~0_218) .cse5 .cse6) 14) (< (+ (* 4 v_main_~i~0_218) (* v_itHalf_23 31) v_main_~j~0_765 .cse5 .cse6) 16) (< (+ v_main_~j~0_765 (* 41 v_itHalf_23) (* 9 v_main_~i~0_218) .cse5 .cse6) 11) (< (+ v_main_~j~0_765 .cse5 (* v_itHalf_23 33) (* 5 v_main_~i~0_218) .cse6) 15) (<= (+ (* v_itHalf_23 2) v_main_~i~0_218) 100) (<= 0 (+ v_main_~j~0_765 (* 23 v_main_~i~0_218) 3 (* v_itHalf_23 69) .cse5 .cse6)) (< (+ v_main_~j~0_765 (* v_itHalf_23 25) .cse5 v_main_~i~0_218 .cse6) 19) (< (+ v_main_~j~0_765 (* v_itHalf_23 65) .cse5 (* 21 v_main_~i~0_218) 1 .cse6) 0) (< (+ v_main_~j~0_765 (* 3 v_main_~i~0_218) (* v_itHalf_23 29) .cse5 .cse6) 17))))) .cse7 (= v_main_~j~0_742 (+ 23 v_main_~j~0_765 (* 69 .cse8) .cse9 (* (* .cse8 v_main_~i~0_218) 46) (* 46 (* .cse8 .cse8)))) (= (mod (+ v_main_~i~0_218 v_main_~i~0_217 1) 2) 0) (<= 0 .cse8))) (and .cse0 (or (not .cse4) (not .cse3) (not .cse7)) .cse1 .cse2)))) InVars {main_~i~0=v_main_~i~0_218, main_~k~0=v_main_~k~0_104, main_~j~0=v_main_~j~0_765} OutVars{main_~i~0=v_main_~i~0_217, main_~k~0=v_main_~k~0_103, main_~j~0=v_main_~j~0_742} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {6286#(<= main_~i~0 0)} is VALID [2022-04-15 06:21:01,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {6286#(<= main_~i~0 0)} [124] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {6263#false} is VALID [2022-04-15 06:21:01,106 INFO L272 TraceCheckUtils]: 8: Hoare triple {6263#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {6263#false} is VALID [2022-04-15 06:21:01,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {6263#false} ~cond := #in~cond; {6263#false} is VALID [2022-04-15 06:21:01,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {6263#false} assume 0 == ~cond; {6263#false} is VALID [2022-04-15 06:21:01,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {6263#false} assume !false; {6263#false} is VALID [2022-04-15 06:21:01,106 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:21:01,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:21:01,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:21:01,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366680726] [2022-04-15 06:21:01,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:21:01,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667882763] [2022-04-15 06:21:01,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667882763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:21:01,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:21:01,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:21:03,419 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:21:03,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1126395220] [2022-04-15 06:21:03,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1126395220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:21:03,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:21:03,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 06:21:03,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196451509] [2022-04-15 06:21:03,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:21:03,420 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 2 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 38 [2022-04-15 06:21:03,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:21:03,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 2 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:21:03,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:21:03,457 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 06:21:03,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:21:03,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 06:21:03,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:21:03,457 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 2 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:21:08,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:08,263 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-04-15 06:21:08,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 06:21:08,263 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 2 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 38 [2022-04-15 06:21:08,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:21:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 2 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:21:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 54 transitions. [2022-04-15 06:21:08,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 2 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:21:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 54 transitions. [2022-04-15 06:21:08,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 54 transitions. [2022-04-15 06:21:08,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:21:08,324 INFO L225 Difference]: With dead ends: 49 [2022-04-15 06:21:08,324 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 06:21:08,325 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=704, Invalid=1948, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 06:21:08,325 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:21:08,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:21:08,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 06:21:08,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-15 06:21:08,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:21:08,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 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:21:08,482 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 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:21:08,482 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 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:21:08,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:08,482 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-15 06:21:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-04-15 06:21:08,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:21:08,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:21:08,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 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 40 states. [2022-04-15 06:21:08,483 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 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 40 states. [2022-04-15 06:21:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:08,483 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-15 06:21:08,483 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-04-15 06:21:08,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:21:08,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:21:08,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:21:08,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:21:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 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:21:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-04-15 06:21:08,484 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 38 [2022-04-15 06:21:08,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:21:08,484 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-04-15 06:21:08,485 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 2 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:21:08,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 42 transitions. [2022-04-15 06:21:08,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:21:08,691 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-04-15 06:21:08,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 06:21:08,691 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:21:08,691 INFO L499 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:21:08,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 06:21:08,892 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:21:08,892 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:21:08,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:21:08,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1736301627, now seen corresponding path program 24 times [2022-04-15 06:21:08,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:21:08,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1813034938] [2022-04-15 06:21:15,051 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:21:19,427 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:21:21,579 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:21:21,954 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:21:26,384 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:21:26,396 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:21:26,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1584012922, now seen corresponding path program 1 times [2022-04-15 06:21:26,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:21:26,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881375203] [2022-04-15 06:21:26,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:21:26,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:21:26,429 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:21:26,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1155605876] [2022-04-15 06:21:26,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:21:26,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:21:26,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:21:26,430 INFO L229 MonitoredProcess]: Starting monitored process 25 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:21:26,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 06:21:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:26,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:21:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:26,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:21:27,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {6631#true} call ULTIMATE.init(); {6631#true} is VALID [2022-04-15 06:21:27,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {6631#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6631#true} is VALID [2022-04-15 06:21:27,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {6631#true} assume true; {6631#true} is VALID [2022-04-15 06:21:27,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6631#true} {6631#true} #75#return; {6631#true} is VALID [2022-04-15 06:21:27,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {6631#true} call #t~ret1 := main(); {6631#true} is VALID [2022-04-15 06:21:27,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {6631#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {6651#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:21:27,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {6651#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [127] L35-3-->L29-2_primed: Formula: (let ((.cse2 (* v_main_~i~0_227 24))) (let ((.cse7 (= v_main_~i~0_227 v_main_~i~0_226)) (.cse8 (= v_main_~k~0_108 v_main_~k~0_107)) (.cse9 (= v_main_~j~0_822 v_main_~j~0_798)) (.cse0 (<= 0 (+ v_main_~j~0_822 .cse2 4))) (.cse6 (< (+ v_main_~j~0_822 3 (* 23 v_main_~i~0_227)) 0)) (.cse5 (<= v_main_~i~0_227 100))) (or (let ((.cse1 (div (+ (- 1) (* (- 1) v_main_~i~0_227) v_main_~i~0_226) 2))) (and .cse0 (= v_main_~j~0_798 (+ v_main_~j~0_822 (* (* .cse1 .cse1) 48) .cse2 (* (* .cse1 v_main_~i~0_227) 48) 24 (* .cse1 72))) (forall ((v_itHalf_24 Int)) (or (not (<= 0 v_itHalf_24)) (let ((.cse3 (* (* v_itHalf_24 v_main_~i~0_227) 48)) (.cse4 (* (* v_itHalf_24 v_itHalf_24) 48))) (and (<= (+ (* v_itHalf_24 2) v_main_~i~0_227) 99) (< (+ .cse3 v_main_~j~0_822 .cse4 22 (* 33 v_main_~i~0_227) (* v_itHalf_24 90)) 0) (< (+ .cse3 v_main_~j~0_822 .cse4 42 (* 43 v_main_~i~0_227) (* v_itHalf_24 110)) 0) (< (+ .cse3 v_main_~j~0_822 40 .cse4 (* v_itHalf_24 108) (* 42 v_main_~i~0_227)) 0) (< (+ .cse3 (* 26 v_main_~i~0_227) v_main_~j~0_822 .cse4 8 (* 76 v_itHalf_24)) 0) (< (+ .cse3 v_main_~j~0_822 .cse4 (* 45 v_main_~i~0_227) 46 (* v_itHalf_24 114)) 0) (< (+ .cse3 v_main_~j~0_822 .cse4 (* v_main_~i~0_227 24) (* v_itHalf_24 72) 4) 0) (< (+ .cse3 v_main_~j~0_822 .cse4 (* v_itHalf_24 78) (* 27 v_main_~i~0_227) 10) 0) (<= 0 (+ .cse3 v_main_~j~0_822 .cse4 (* v_itHalf_24 120) (* 48 v_main_~i~0_227) 52)) (< (+ .cse3 v_main_~j~0_822 .cse4 (* v_itHalf_24 104) (* 40 v_main_~i~0_227) 36) 0) (< (+ .cse3 v_main_~j~0_822 .cse4 (* 28 v_main_~i~0_227) 12 (* v_itHalf_24 80)) 0) (< (+ .cse3 v_main_~j~0_822 (* 41 v_main_~i~0_227) .cse4 (* 106 v_itHalf_24) 38) 0) (< (+ .cse3 v_main_~j~0_822 .cse4 20 (* 32 v_main_~i~0_227) (* 88 v_itHalf_24)) 0) (< (+ .cse3 v_main_~j~0_822 (* v_itHalf_24 74) .cse4 6 (* 25 v_main_~i~0_227)) 0) (< (+ .cse3 v_main_~j~0_822 .cse4 (* v_itHalf_24 96) (* 36 v_main_~i~0_227) 28) 0) (< (+ .cse3 v_main_~j~0_822 .cse4 (* v_itHalf_24 84) 16 (* 30 v_main_~i~0_227)) 0) (< (+ .cse3 v_main_~j~0_822 .cse4 (* 31 v_main_~i~0_227) 18 (* v_itHalf_24 86)) 0) (< (+ .cse3 v_main_~j~0_822 .cse4 14 (* 29 v_main_~i~0_227) (* v_itHalf_24 82)) 0) (< (+ .cse3 v_main_~j~0_822 (* v_itHalf_24 94) .cse4 (* 35 v_main_~i~0_227) 26) 0) (< (+ .cse3 v_main_~j~0_822 .cse4 (* 92 v_itHalf_24) (* 34 v_main_~i~0_227) 24) 0) (< (+ .cse3 v_main_~j~0_822 .cse4 (* 46 v_main_~i~0_227) 48 (* 116 v_itHalf_24)) 0) (< (+ .cse3 v_main_~j~0_822 .cse4 44 (* 112 v_itHalf_24) (* 44 v_main_~i~0_227)) 0) (< (+ .cse3 v_main_~j~0_822 (* v_itHalf_24 102) .cse4 34 (* 39 v_main_~i~0_227)) 0) (< (+ .cse3 v_main_~j~0_822 .cse4 (* v_itHalf_24 118) (* 47 v_main_~i~0_227) 50) 0) (< (+ (* 37 v_main_~i~0_227) .cse3 v_main_~j~0_822 .cse4 (* v_itHalf_24 98) 30) 0) (< (+ .cse3 v_main_~j~0_822 .cse4 32 (* v_itHalf_24 100) (* 38 v_main_~i~0_227)) 0))) (not (<= (+ v_itHalf_24 1) (div (+ (- 1) (* (- 1) v_main_~i~0_227) v_main_~i~0_226) 2))))) .cse5 (= v_main_~k~0_107 4) .cse6 (<= 0 .cse1) (= (mod (+ v_main_~i~0_227 v_main_~i~0_226 1) 2) 0))) (and .cse7 .cse8 .cse9) (and .cse7 .cse8 .cse9 (or (not .cse0) (not .cse6) (not .cse5)))))) InVars {main_~i~0=v_main_~i~0_227, main_~k~0=v_main_~k~0_108, main_~j~0=v_main_~j~0_822} OutVars{main_~i~0=v_main_~i~0_226, main_~k~0=v_main_~k~0_107, main_~j~0=v_main_~j~0_798} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {6655#(<= main_~i~0 0)} is VALID [2022-04-15 06:21:27,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {6655#(<= main_~i~0 0)} [126] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {6632#false} is VALID [2022-04-15 06:21:27,480 INFO L272 TraceCheckUtils]: 8: Hoare triple {6632#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {6632#false} is VALID [2022-04-15 06:21:27,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {6632#false} ~cond := #in~cond; {6632#false} is VALID [2022-04-15 06:21:27,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {6632#false} assume 0 == ~cond; {6632#false} is VALID [2022-04-15 06:21:27,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {6632#false} assume !false; {6632#false} is VALID [2022-04-15 06:21:27,480 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:21:27,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:21:27,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:21:27,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881375203] [2022-04-15 06:21:27,480 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:21:27,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155605876] [2022-04-15 06:21:27,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155605876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:21:27,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:21:27,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:21:30,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:21:30,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1813034938] [2022-04-15 06:21:30,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1813034938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:21:30,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:21:30,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 06:21:30,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971074756] [2022-04-15 06:21:30,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:21:30,527 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 2 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 39 [2022-04-15 06:21:30,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:21:30,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 2 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:21:30,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:21:30,569 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 06:21:30,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:21:30,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 06:21:30,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2022-04-15 06:21:30,569 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 2 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:21:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:35,923 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-04-15 06:21:35,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 06:21:35,923 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 2 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 39 [2022-04-15 06:21:35,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:21:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 2 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:21:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 55 transitions. [2022-04-15 06:21:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 2 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:21:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 55 transitions. [2022-04-15 06:21:35,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 55 transitions. [2022-04-15 06:21:35,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:21:35,988 INFO L225 Difference]: With dead ends: 50 [2022-04-15 06:21:35,988 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 06:21:35,988 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=758, Invalid=2104, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 06:21:35,989 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:21:35,989 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:21:35,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 06:21:36,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-15 06:21:36,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:21:36,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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:21:36,149 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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:21:36,149 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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:21:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:36,149 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-15 06:21:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 06:21:36,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:21:36,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:21:36,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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 41 states. [2022-04-15 06:21:36,150 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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 41 states. [2022-04-15 06:21:36,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:36,150 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-15 06:21:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 06:21:36,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:21:36,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:21:36,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:21:36,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:21:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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:21:36,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-04-15 06:21:36,151 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 39 [2022-04-15 06:21:36,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:21:36,151 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-04-15 06:21:36,151 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 2 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:21:36,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 43 transitions. [2022-04-15 06:21:36,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:21:36,427 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 06:21:36,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 06:21:36,427 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:21:36,427 INFO L499 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:21:36,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 06:21:36,627 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 06:21:36,628 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:21:36,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:21:36,628 INFO L85 PathProgramCache]: Analyzing trace with hash -234694540, now seen corresponding path program 25 times [2022-04-15 06:21:36,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:21:36,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1091831417] [2022-04-15 06:21:38,817 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:21:43,215 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:21:43,483 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:21:43,886 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:21:47,927 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:21:47,938 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:21:47,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1643118266, now seen corresponding path program 1 times [2022-04-15 06:21:47,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:21:47,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372213975] [2022-04-15 06:21:47,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:21:47,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:21:47,966 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:21:47,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2094671259] [2022-04-15 06:21:47,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:21:47,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:21:47,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:21:47,968 INFO L229 MonitoredProcess]: Starting monitored process 26 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:21:47,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 06:21:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:48,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:21:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:48,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:21:48,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {7009#true} call ULTIMATE.init(); {7009#true} is VALID [2022-04-15 06:21:48,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {7009#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7009#true} is VALID [2022-04-15 06:21:48,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {7009#true} assume true; {7009#true} is VALID [2022-04-15 06:21:48,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7009#true} {7009#true} #75#return; {7009#true} is VALID [2022-04-15 06:21:48,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {7009#true} call #t~ret1 := main(); {7009#true} is VALID [2022-04-15 06:21:48,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {7009#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {7029#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:21:48,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {7029#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [129] L35-3-->L29-2_primed: Formula: (let ((.cse5 (* 25 v_main_~i~0_236))) (let ((.cse0 (<= v_main_~i~0_236 100)) (.cse6 (< (+ v_main_~j~0_881 (* v_main_~i~0_236 24) 4) 0)) (.cse1 (<= 0 (+ v_main_~j~0_881 5 .cse5))) (.cse7 (= v_main_~j~0_881 v_main_~j~0_856)) (.cse8 (= v_main_~k~0_112 v_main_~k~0_111))) (or (let ((.cse2 (div (+ (- 1) (* (- 1) v_main_~i~0_236) v_main_~i~0_235) 2))) (and (= v_main_~k~0_111 4) .cse0 .cse1 (<= 0 .cse2) (forall ((v_itHalf_25 Int)) (or (not (<= 0 v_itHalf_25)) (not (<= (+ v_itHalf_25 1) (div (+ (- 1) (* (- 1) v_main_~i~0_236) v_main_~i~0_235) 2))) (let ((.cse3 (* (* v_itHalf_25 v_itHalf_25) 50)) (.cse4 (* (* v_itHalf_25 v_main_~i~0_236) 50))) (and (< (+ 23 v_main_~j~0_881 (* v_itHalf_25 93) (* 34 v_main_~i~0_236) .cse3 .cse4) 0) (<= 0 (+ v_main_~j~0_881 (* v_main_~i~0_236 50) (* 125 v_itHalf_25) .cse3 55 .cse4)) (< (+ v_main_~j~0_881 (* 77 v_itHalf_25) 7 .cse3 .cse4 (* 26 v_main_~i~0_236)) 0) (< (+ 53 v_main_~j~0_881 (* 49 v_main_~i~0_236) (* v_itHalf_25 123) .cse3 .cse4) 0) (< (+ v_main_~j~0_881 (* 32 v_main_~i~0_236) 19 (* v_itHalf_25 89) .cse3 .cse4) 0) (< (+ v_main_~j~0_881 (* v_itHalf_25 75) 5 .cse3 .cse4 (* 25 v_main_~i~0_236)) 0) (< (+ (* 48 v_main_~i~0_236) v_main_~j~0_881 51 (* v_itHalf_25 121) .cse3 .cse4) 0) (< (+ v_main_~j~0_881 (* 33 v_main_~i~0_236) 21 .cse3 (* 91 v_itHalf_25) .cse4) 0) (< (+ (* 42 v_main_~i~0_236) v_main_~j~0_881 (* v_itHalf_25 109) .cse3 39 .cse4) 0) (< (+ v_main_~j~0_881 (* 29 v_main_~i~0_236) .cse3 13 .cse4 (* v_itHalf_25 83)) 0) (< (+ v_main_~j~0_881 31 .cse3 (* 101 v_itHalf_25) (* 38 v_main_~i~0_236) .cse4) 0) (< (+ v_main_~j~0_881 .cse3 (* v_itHalf_25 81) (* 28 v_main_~i~0_236) .cse4 11) 0) (< (+ v_main_~j~0_881 .cse3 (* 31 v_main_~i~0_236) 17 .cse4 (* v_itHalf_25 87)) 0) (< (+ (* 43 v_main_~i~0_236) 41 v_main_~j~0_881 (* 111 v_itHalf_25) .cse3 .cse4) 0) (< (+ (* 45 v_main_~i~0_236) v_main_~j~0_881 .cse3 45 .cse4 (* 115 v_itHalf_25)) 0) (< (+ v_main_~j~0_881 49 (* 47 v_main_~i~0_236) .cse3 (* 119 v_itHalf_25) .cse4) 0) (< (+ v_main_~j~0_881 (* 44 v_main_~i~0_236) .cse3 (* v_itHalf_25 113) 43 .cse4) 0) (< (+ v_main_~j~0_881 (* 36 v_main_~i~0_236) (* v_itHalf_25 97) .cse3 .cse4 27) 0) (<= (+ (* v_itHalf_25 2) v_main_~i~0_236) 99) (< (+ (* 41 v_main_~i~0_236) v_main_~j~0_881 .cse3 (* v_itHalf_25 107) .cse4 37) 0) (< (+ (* 46 v_main_~i~0_236) v_main_~j~0_881 47 .cse3 (* v_itHalf_25 117) .cse4) 0) (< (+ (* 40 v_main_~i~0_236) v_main_~j~0_881 35 .cse3 (* v_itHalf_25 105) .cse4) 0) (< (+ v_main_~j~0_881 .cse3 33 (* v_itHalf_25 103) (* 39 v_main_~i~0_236) .cse4) 0) (< (+ v_main_~j~0_881 (* 35 v_main_~i~0_236) .cse3 (* v_itHalf_25 95) 25 .cse4) 0) (< (+ v_main_~j~0_881 (* v_itHalf_25 85) (* 30 v_main_~i~0_236) .cse3 15 .cse4) 0) (< (+ (* 37 v_main_~i~0_236) v_main_~j~0_881 (* v_itHalf_25 99) 29 .cse3 .cse4) 0) (< (+ v_main_~j~0_881 (* 27 v_main_~i~0_236) 9 (* v_itHalf_25 79) .cse3 .cse4) 0))))) (= v_main_~j~0_856 (+ v_main_~j~0_881 (* (* .cse2 .cse2) 50) (* .cse2 75) (* (* .cse2 v_main_~i~0_236) 50) 25 .cse5)) .cse6 (= (mod (+ v_main_~i~0_235 v_main_~i~0_236 1) 2) 0))) (and .cse7 (or (not .cse0) (not .cse6) (not .cse1)) .cse8 (= v_main_~i~0_235 v_main_~i~0_236)) (and .cse7 (= v_main_~i~0_236 v_main_~i~0_235) .cse8)))) InVars {main_~i~0=v_main_~i~0_236, main_~k~0=v_main_~k~0_112, main_~j~0=v_main_~j~0_881} OutVars{main_~i~0=v_main_~i~0_235, main_~k~0=v_main_~k~0_111, main_~j~0=v_main_~j~0_856} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {7033#(<= main_~i~0 0)} is VALID [2022-04-15 06:21:48,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {7033#(<= main_~i~0 0)} [128] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {7010#false} is VALID [2022-04-15 06:21:48,853 INFO L272 TraceCheckUtils]: 8: Hoare triple {7010#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {7010#false} is VALID [2022-04-15 06:21:48,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {7010#false} ~cond := #in~cond; {7010#false} is VALID [2022-04-15 06:21:48,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {7010#false} assume 0 == ~cond; {7010#false} is VALID [2022-04-15 06:21:48,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {7010#false} assume !false; {7010#false} is VALID [2022-04-15 06:21:48,853 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:21:48,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:21:48,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:21:48,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372213975] [2022-04-15 06:21:48,853 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:21:48,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094671259] [2022-04-15 06:21:48,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094671259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:21:48,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:21:48,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:21:51,930 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:21:51,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1091831417] [2022-04-15 06:21:51,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1091831417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:21:51,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:21:51,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 06:21:51,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032591204] [2022-04-15 06:21:51,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:21:51,931 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 2 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 40 [2022-04-15 06:21:51,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:21:51,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 2 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:21:51,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:21:51,974 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 06:21:51,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:21:51,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 06:21:51,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:21:51,975 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 2 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:21:59,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:59,437 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-15 06:21:59,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 06:21:59,437 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 2 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 40 [2022-04-15 06:21:59,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:21:59,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 2 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:21:59,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 56 transitions. [2022-04-15 06:21:59,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 2 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:21:59,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 56 transitions. [2022-04-15 06:21:59,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 56 transitions. [2022-04-15 06:21:59,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:21:59,512 INFO L225 Difference]: With dead ends: 51 [2022-04-15 06:21:59,512 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 06:21:59,513 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=814, Invalid=2266, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 06:21:59,513 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:21:59,513 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:21:59,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 06:21:59,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-15 06:21:59,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:21:59,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 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:21:59,691 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 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:21:59,691 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 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:21:59,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:59,691 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-15 06:21:59,692 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-15 06:21:59,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:21:59,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:21:59,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 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 42 states. [2022-04-15 06:21:59,692 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 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 42 states. [2022-04-15 06:21:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:59,692 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-15 06:21:59,693 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-15 06:21:59,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:21:59,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:21:59,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:21:59,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:21:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 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:21:59,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-04-15 06:21:59,693 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 40 [2022-04-15 06:21:59,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:21:59,694 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-04-15 06:21:59,694 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 2 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:21:59,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2022-04-15 06:22:00,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-15 06:22:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 06:22:00,001 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:22:00,002 INFO L499 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:22:00,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-15 06:22:00,202 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 06:22:00,202 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:22:00,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:22:00,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1206033573, now seen corresponding path program 26 times [2022-04-15 06:22:00,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:22:00,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [243499923] [2022-04-15 06:22:07,809 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:22:12,293 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:22:18,588 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:22:19,001 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:22:27,656 WARN L232 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 463 DAG size of output: 215 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-15 06:22:27,696 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:22:27,708 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:22:27,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1702223610, now seen corresponding path program 1 times [2022-04-15 06:22:27,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:22:27,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753718633] [2022-04-15 06:22:27,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:22:27,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:22:27,738 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:22:27,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [35460957] [2022-04-15 06:22:27,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:22:27,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:22:27,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:22:27,740 INFO L229 MonitoredProcess]: Starting monitored process 27 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:22:27,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 06:22:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:27,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:22:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:27,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:22:28,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {7396#true} call ULTIMATE.init(); {7396#true} is VALID [2022-04-15 06:22:28,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {7396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7396#true} is VALID [2022-04-15 06:22:28,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {7396#true} assume true; {7396#true} is VALID [2022-04-15 06:22:28,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7396#true} {7396#true} #75#return; {7396#true} is VALID [2022-04-15 06:22:28,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {7396#true} call #t~ret1 := main(); {7396#true} is VALID [2022-04-15 06:22:28,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {7396#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {7416#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:22:28,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {7416#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [131] L35-3-->L29-2_primed: Formula: (let ((.cse2 (* 26 v_main_~i~0_245))) (let ((.cse6 (<= 0 (+ v_main_~j~0_942 .cse2 6))) (.cse0 (< (+ v_main_~j~0_942 5 (* 25 v_main_~i~0_245)) 0)) (.cse3 (<= v_main_~i~0_245 100)) (.cse7 (= v_main_~j~0_942 v_main_~j~0_916)) (.cse8 (= v_main_~k~0_116 v_main_~k~0_115)) (.cse9 (= v_main_~i~0_245 v_main_~i~0_244))) (or (let ((.cse1 (div (+ (- 1) (* (- 1) v_main_~i~0_245) v_main_~i~0_244) 2))) (and .cse0 (= (mod (+ v_main_~i~0_245 v_main_~i~0_244 1) 2) 0) (= v_main_~k~0_115 4) (= v_main_~j~0_916 (+ (* 52 (* .cse1 .cse1)) (* .cse1 78) v_main_~j~0_942 .cse2 26 (* 52 (* .cse1 v_main_~i~0_245)))) .cse3 (forall ((v_itHalf_26 Int)) (or (not (<= 1 v_itHalf_26)) (let ((.cse4 (* 52 (* v_itHalf_26 v_itHalf_26))) (.cse5 (* 52 (* v_itHalf_26 v_main_~i~0_245)))) (and (< (+ v_main_~j~0_942 (* 3 v_main_~i~0_245) .cse4 .cse5 (* v_itHalf_26 32)) 17) (< (+ v_main_~j~0_942 .cse4 (* v_main_~i~0_245 24) (* v_itHalf_26 74) 4 .cse5) 0) (< (+ v_main_~j~0_942 (* 11 v_main_~i~0_245) .cse4 (* v_itHalf_26 48) .cse5) 9) (< (+ v_main_~j~0_942 (* 56 v_itHalf_26) .cse4 (* 15 v_main_~i~0_245) .cse5) 5) (< (+ v_main_~j~0_942 (* 8 v_main_~i~0_245) .cse4 (* v_itHalf_26 42) .cse5) 12) (< (+ (* v_itHalf_26 60) v_main_~j~0_942 (* 17 v_main_~i~0_245) .cse4 .cse5) 3) (< (+ v_main_~j~0_942 (* v_itHalf_26 38) .cse4 (* 6 v_main_~i~0_245) .cse5) 14) (<= (+ (* v_itHalf_26 2) v_main_~i~0_245) 100) (< (+ (* v_itHalf_26 36) v_main_~j~0_942 (* 5 v_main_~i~0_245) .cse4 .cse5) 15) (< (+ v_main_~j~0_942 (* v_itHalf_26 34) .cse4 (* 4 v_main_~i~0_245) .cse5) 16) (< (+ v_main_~j~0_942 (* v_itHalf_26 62) .cse4 .cse5 (* 18 v_main_~i~0_245)) 2) (< (+ v_main_~j~0_942 (* v_itHalf_26 64) .cse4 (* 19 v_main_~i~0_245) .cse5) 1) (< (+ (* 76 v_itHalf_26) v_main_~j~0_942 5 .cse4 .cse5 (* 25 v_main_~i~0_245)) 0) (<= 0 (+ v_main_~j~0_942 (* 26 v_main_~i~0_245) (* v_itHalf_26 78) 6 .cse4 .cse5)) (< (+ (* 20 v_main_~i~0_245) v_main_~j~0_942 (* 66 v_itHalf_26) .cse4 .cse5) 0) (< (+ v_main_~j~0_942 .cse4 .cse5 v_main_~i~0_245 (* v_itHalf_26 28)) 19) (< (+ (* 7 v_main_~i~0_245) v_main_~j~0_942 (* 40 v_itHalf_26) .cse4 .cse5) 13) (< (+ v_main_~j~0_942 (* 21 v_main_~i~0_245) .cse4 .cse5 (* v_itHalf_26 68) 1) 0) (< (+ v_main_~j~0_942 (* v_itHalf_26 54) (* 14 v_main_~i~0_245) .cse4 .cse5) 6) (< (+ v_main_~j~0_942 (* 12 v_main_~i~0_245) .cse4 .cse5 (* v_itHalf_26 50)) 8) (< (+ v_main_~j~0_942 (* v_itHalf_26 26) .cse4 .cse5) 20) (< (+ v_main_~j~0_942 (* 16 v_main_~i~0_245) .cse4 (* v_itHalf_26 58) .cse5) 4) (< (+ v_main_~j~0_942 .cse4 (* 10 v_main_~i~0_245) .cse5 (* v_itHalf_26 46)) 10) (< (+ v_main_~j~0_942 2 .cse4 (* 22 v_main_~i~0_245) .cse5 (* v_itHalf_26 70)) 0) (< (+ v_main_~j~0_942 (* v_itHalf_26 72) 3 .cse4 .cse5 (* 23 v_main_~i~0_245)) 0) (< (+ v_main_~j~0_942 (* v_itHalf_26 44) .cse4 .cse5 (* 9 v_main_~i~0_245)) 11) (< (+ v_main_~j~0_942 .cse4 (* v_itHalf_26 30) (* 2 v_main_~i~0_245) .cse5) 18) (< (+ v_main_~j~0_942 .cse4 (* 13 v_main_~i~0_245) .cse5 (* v_itHalf_26 52)) 7))) (not (<= v_itHalf_26 (div (+ (- 1) (* (- 1) v_main_~i~0_245) v_main_~i~0_244) 2))))) .cse6 (<= 0 .cse1))) (and .cse7 .cse8 .cse9 (or (not .cse6) (not .cse0) (not .cse3))) (and .cse7 .cse8 .cse9)))) InVars {main_~i~0=v_main_~i~0_245, main_~k~0=v_main_~k~0_116, main_~j~0=v_main_~j~0_942} OutVars{main_~i~0=v_main_~i~0_244, main_~k~0=v_main_~k~0_115, main_~j~0=v_main_~j~0_916} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {7420#(<= main_~i~0 0)} is VALID [2022-04-15 06:22:28,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {7420#(<= main_~i~0 0)} [130] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {7397#false} is VALID [2022-04-15 06:22:28,905 INFO L272 TraceCheckUtils]: 8: Hoare triple {7397#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {7397#false} is VALID [2022-04-15 06:22:28,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#false} ~cond := #in~cond; {7397#false} is VALID [2022-04-15 06:22:28,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {7397#false} assume 0 == ~cond; {7397#false} is VALID [2022-04-15 06:22:28,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {7397#false} assume !false; {7397#false} is VALID [2022-04-15 06:22:28,906 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:22:28,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:22:28,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:22:28,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753718633] [2022-04-15 06:22:28,906 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:22:28,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35460957] [2022-04-15 06:22:28,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35460957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:22:28,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:22:28,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:22:32,729 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:22:32,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [243499923] [2022-04-15 06:22:32,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [243499923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:22:32,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:22:32,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 06:22:32,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078083226] [2022-04-15 06:22:32,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:22:32,730 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (3), 2 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 41 [2022-04-15 06:22:32,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:22:32,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (3), 2 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:22:32,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:32,777 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 06:22:32,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:22:32,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 06:22:32,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2022-04-15 06:22:32,777 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (3), 2 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:22:41,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:41,939 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-15 06:22:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 06:22:41,939 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (3), 2 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 41 [2022-04-15 06:22:41,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:22:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (3), 2 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:22:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 57 transitions. [2022-04-15 06:22:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (3), 2 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:22:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 57 transitions. [2022-04-15 06:22:41,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 57 transitions. [2022-04-15 06:22:42,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:42,016 INFO L225 Difference]: With dead ends: 52 [2022-04-15 06:22:42,016 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 06:22:42,016 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=872, Invalid=2434, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 06:22:42,017 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:22:42,017 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:22:42,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 06:22:42,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-15 06:22:42,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:22:42,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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:22:42,211 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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:22:42,212 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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:22:42,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:42,212 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-04-15 06:22:42,212 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-15 06:22:42,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:22:42,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:22:42,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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 43 states. [2022-04-15 06:22:42,213 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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 43 states. [2022-04-15 06:22:42,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:42,213 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-04-15 06:22:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-15 06:22:42,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:22:42,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:22:42,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:22:42,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:22:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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:22:42,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-04-15 06:22:42,214 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 41 [2022-04-15 06:22:42,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:22:42,214 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-04-15 06:22:42,214 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (3), 2 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:22:42,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 45 transitions. [2022-04-15 06:22:42,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:42,550 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-15 06:22:42,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 06:22:42,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:22:42,550 INFO L499 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:22:42,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 06:22:42,750 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 06:22:42,751 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:22:42,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:22:42,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1252772524, now seen corresponding path program 27 times [2022-04-15 06:22:42,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:22:42,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [702821798] [2022-04-15 06:22:51,282 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:22:55,628 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:23:04,071 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:23:04,411 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:23:10,141 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:23:10,153 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:23:10,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1761328954, now seen corresponding path program 1 times [2022-04-15 06:23:10,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:23:10,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492572245] [2022-04-15 06:23:10,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:23:10,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:23:10,182 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:23:10,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [404185986] [2022-04-15 06:23:10,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:23:10,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:23:10,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:23:10,184 INFO L229 MonitoredProcess]: Starting monitored process 28 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:23:10,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 06:23:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:10,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:23:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:10,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:23:11,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {7792#true} call ULTIMATE.init(); {7792#true} is VALID [2022-04-15 06:23:11,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {7792#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7792#true} is VALID [2022-04-15 06:23:11,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {7792#true} assume true; {7792#true} is VALID [2022-04-15 06:23:11,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7792#true} {7792#true} #75#return; {7792#true} is VALID [2022-04-15 06:23:11,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {7792#true} call #t~ret1 := main(); {7792#true} is VALID [2022-04-15 06:23:11,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {7792#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {7812#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:23:11,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {7812#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [133] L35-3-->L29-2_primed: Formula: (let ((.cse6 (* 27 v_main_~i~0_254))) (let ((.cse1 (<= v_main_~i~0_254 100)) (.cse2 (< (+ (* 26 v_main_~i~0_254) 6 v_main_~j~0_1005) 0)) (.cse3 (<= 0 (+ 7 v_main_~j~0_1005 .cse6))) (.cse0 (= v_main_~k~0_120 v_main_~k~0_119)) (.cse4 (= v_main_~i~0_254 v_main_~i~0_253))) (or (and (= v_main_~j~0_978 v_main_~j~0_1005) .cse0 (or (not .cse1) (not .cse2) (not .cse3)) .cse4) (let ((.cse5 (div (+ (- 1) (* (- 1) v_main_~i~0_254) v_main_~i~0_253) 2))) (and (<= 0 .cse5) (= v_main_~j~0_978 (+ (* (* .cse5 v_main_~i~0_254) 54) v_main_~j~0_1005 (* .cse5 81) (* (* .cse5 .cse5) 54) 27 .cse6)) (= (mod (+ v_main_~i~0_254 v_main_~i~0_253 1) 2) 0) .cse1 (forall ((v_itHalf_27 Int)) (or (not (<= (+ v_itHalf_27 1) (div (+ (- 1) (* (- 1) v_main_~i~0_254) v_main_~i~0_253) 2))) (not (<= 0 v_itHalf_27)) (let ((.cse7 (* (* v_itHalf_27 v_itHalf_27) 54)) (.cse8 (* (* v_itHalf_27 v_main_~i~0_254) 54))) (and (< (+ (* 33 v_main_~i~0_254) .cse7 19 .cse8 v_main_~j~0_1005 (* v_itHalf_27 93)) 0) (< (+ .cse7 (* v_itHalf_27 87) .cse8 (* 30 v_main_~i~0_254) v_main_~j~0_1005 13) 0) (< (+ .cse7 49 .cse8 (* 48 v_main_~i~0_254) v_main_~j~0_1005 (* v_itHalf_27 123)) 0) (< (+ .cse7 .cse8 (* 43 v_main_~i~0_254) v_main_~j~0_1005 39 (* v_itHalf_27 113)) 0) (< (+ .cse7 57 (* 131 v_itHalf_27) .cse8 (* 52 v_main_~i~0_254) v_main_~j~0_1005) 0) (< (+ .cse7 7 (* v_itHalf_27 81) .cse8 v_main_~j~0_1005 (* 27 v_main_~i~0_254)) 0) (< (+ .cse7 (* 38 v_main_~i~0_254) .cse8 29 (* v_itHalf_27 103) v_main_~j~0_1005) 0) (< (+ .cse7 (* 101 v_itHalf_27) .cse8 v_main_~j~0_1005 (* 37 v_main_~i~0_254) 27) 0) (< (+ .cse7 .cse8 v_main_~j~0_1005 15 (* 31 v_main_~i~0_254) (* v_itHalf_27 89)) 0) (<= 0 (+ .cse7 .cse8 v_main_~j~0_1005 (* 54 v_main_~i~0_254) 61 (* v_itHalf_27 135))) (< (+ .cse7 (* v_itHalf_27 107) .cse8 v_main_~j~0_1005 (* 40 v_main_~i~0_254) 33) 0) (< (+ .cse7 (* 41 v_main_~i~0_254) 35 .cse8 v_main_~j~0_1005 (* v_itHalf_27 109)) 0) (< (+ .cse7 (* v_itHalf_27 105) .cse8 31 v_main_~j~0_1005 (* 39 v_main_~i~0_254)) 0) (< (+ (* 53 v_main_~i~0_254) .cse7 .cse8 (* v_itHalf_27 133) 59 v_main_~j~0_1005) 0) (< (+ .cse7 (* v_itHalf_27 99) .cse8 v_main_~j~0_1005 25 (* 36 v_main_~i~0_254)) 0) (< (+ .cse7 (* 29 v_main_~i~0_254) .cse8 v_main_~j~0_1005 (* v_itHalf_27 85) 11) 0) (< (+ .cse7 (* v_itHalf_27 95) .cse8 21 v_main_~j~0_1005 (* 34 v_main_~i~0_254)) 0) (< (+ 53 .cse7 .cse8 v_main_~j~0_1005 (* v_main_~i~0_254 50) (* v_itHalf_27 127)) 0) (< (+ .cse7 51 .cse8 v_main_~j~0_1005 (* 49 v_main_~i~0_254) (* 125 v_itHalf_27)) 0) (< (+ (* 47 v_main_~i~0_254) .cse7 .cse8 47 (* v_itHalf_27 121) v_main_~j~0_1005) 0) (< (+ .cse7 23 (* v_itHalf_27 97) .cse8 v_main_~j~0_1005 (* 35 v_main_~i~0_254)) 0) (< (+ .cse7 (* 111 v_itHalf_27) .cse8 v_main_~j~0_1005 37 (* 42 v_main_~i~0_254)) 0) (< (+ (* 91 v_itHalf_27) .cse7 .cse8 v_main_~j~0_1005 (* 32 v_main_~i~0_254) 17) 0) (< (+ .cse7 .cse8 v_main_~j~0_1005 55 (* 51 v_main_~i~0_254) (* v_itHalf_27 129)) 0) (< (+ .cse7 .cse8 v_main_~j~0_1005 (* 119 v_itHalf_27) 45 (* 46 v_main_~i~0_254)) 0) (< (+ .cse7 .cse8 9 (* v_itHalf_27 83) v_main_~j~0_1005 (* 28 v_main_~i~0_254)) 0) (< (+ .cse7 .cse8 (* 45 v_main_~i~0_254) (* v_itHalf_27 117) v_main_~j~0_1005 43) 0) (< (+ 41 .cse7 (* 44 v_main_~i~0_254) .cse8 (* 115 v_itHalf_27) v_main_~j~0_1005) 0) (<= (+ (* v_itHalf_27 2) v_main_~i~0_254) 99))))) .cse2 (= v_main_~k~0_119 4) .cse3)) (and .cse0 (= v_main_~j~0_1005 v_main_~j~0_978) .cse4)))) InVars {main_~i~0=v_main_~i~0_254, main_~k~0=v_main_~k~0_120, main_~j~0=v_main_~j~0_1005} OutVars{main_~i~0=v_main_~i~0_253, main_~k~0=v_main_~k~0_119, main_~j~0=v_main_~j~0_978} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {7816#(<= main_~i~0 0)} is VALID [2022-04-15 06:23:11,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {7816#(<= main_~i~0 0)} [132] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {7793#false} is VALID [2022-04-15 06:23:11,028 INFO L272 TraceCheckUtils]: 8: Hoare triple {7793#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {7793#false} is VALID [2022-04-15 06:23:11,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {7793#false} ~cond := #in~cond; {7793#false} is VALID [2022-04-15 06:23:11,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {7793#false} assume 0 == ~cond; {7793#false} is VALID [2022-04-15 06:23:11,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {7793#false} assume !false; {7793#false} is VALID [2022-04-15 06:23:11,028 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:23:11,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:23:11,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:23:11,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492572245] [2022-04-15 06:23:11,028 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:23:11,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404185986] [2022-04-15 06:23:11,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404185986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:23:11,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:23:11,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:23:15,294 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:23:15,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [702821798] [2022-04-15 06:23:15,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [702821798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:23:15,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:23:15,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 06:23:15,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749737160] [2022-04-15 06:23:15,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:23:15,297 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 2 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 42 [2022-04-15 06:23:15,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:23:15,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 2 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:23:15,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:23:15,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 06:23:15,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:23:15,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 06:23:15,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:23:15,359 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 2 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:23:25,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:23:25,686 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-15 06:23:25,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 06:23:25,686 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 2 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 42 [2022-04-15 06:23:25,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:23:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 2 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:23:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 58 transitions. [2022-04-15 06:23:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 2 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:23:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 58 transitions. [2022-04-15 06:23:25,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 58 transitions. [2022-04-15 06:23:25,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:23:25,762 INFO L225 Difference]: With dead ends: 53 [2022-04-15 06:23:25,762 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 06:23:25,763 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=932, Invalid=2608, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 06:23:25,763 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:23:25,763 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 363 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:23:25,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 06:23:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 06:23:25,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:23:25,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 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:23:25,960 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 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:23:25,960 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 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:23:25,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:23:25,961 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-15 06:23:25,961 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 06:23:25,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:23:25,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:23:25,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 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 44 states. [2022-04-15 06:23:25,961 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 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 44 states. [2022-04-15 06:23:25,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:23:25,962 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-15 06:23:25,962 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 06:23:25,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:23:25,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:23:25,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:23:25,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:23:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 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:23:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-15 06:23:25,963 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 42 [2022-04-15 06:23:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:23:25,963 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-15 06:23:25,963 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 2 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:23:25,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-15 06:23:26,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:23:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 06:23:26,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 06:23:26,396 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:23:26,396 INFO L499 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:23:26,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 06:23:26,596 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:23:26,596 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:23:26,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:23:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1593287291, now seen corresponding path program 28 times [2022-04-15 06:23:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:23:26,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [416278557] [2022-04-15 06:23:33,116 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:23:37,775 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:23:44,234 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:23:44,644 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:24:04,930 WARN L232 SmtUtils]: Spent 17.82s on a formula simplification. DAG size of input: 492 DAG size of output: 227 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-15 06:24:04,973 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:24:04,984 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:24:04,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1820434298, now seen corresponding path program 1 times [2022-04-15 06:24:04,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:24:05,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151265223] [2022-04-15 06:24:05,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:24:05,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:24:05,016 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:24:05,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930676898] [2022-04-15 06:24:05,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:24:05,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:24:05,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:24:05,017 INFO L229 MonitoredProcess]: Starting monitored process 29 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:24:05,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 06:24:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:24:05,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:24:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:24:05,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:24:06,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {8197#true} call ULTIMATE.init(); {8197#true} is VALID [2022-04-15 06:24:06,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {8197#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8197#true} is VALID [2022-04-15 06:24:06,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {8197#true} assume true; {8197#true} is VALID [2022-04-15 06:24:06,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8197#true} {8197#true} #75#return; {8197#true} is VALID [2022-04-15 06:24:06,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {8197#true} call #t~ret1 := main(); {8197#true} is VALID [2022-04-15 06:24:06,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {8197#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {8217#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:24:06,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {8217#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [135] L35-3-->L29-2_primed: Formula: (let ((.cse8 (* 28 v_main_~i~0_263))) (let ((.cse0 (= v_main_~i~0_263 v_main_~i~0_262)) (.cse1 (= v_main_~j~0_1070 v_main_~j~0_1042)) (.cse7 (< (+ 7 v_main_~j~0_1070 (* 27 v_main_~i~0_263)) 0)) (.cse2 (<= v_main_~i~0_263 100)) (.cse6 (<= 0 (+ .cse8 v_main_~j~0_1070 8)))) (or (and .cse0 (= v_main_~k~0_124 v_main_~k~0_123) .cse1) (let ((.cse3 (div (+ (- 1) (* (- 1) v_main_~i~0_263) v_main_~i~0_262) 2))) (and .cse2 (<= 0 .cse3) (= (mod (+ v_main_~i~0_263 v_main_~i~0_262 1) 2) 0) (forall ((v_itHalf_28 Int)) (or (not (<= v_itHalf_28 (div (+ (- 1) (* (- 1) v_main_~i~0_263) v_main_~i~0_262) 2))) (let ((.cse4 (* 56 (* v_itHalf_28 v_main_~i~0_263))) (.cse5 (* 56 (* v_itHalf_28 v_itHalf_28)))) (and (< (+ .cse4 .cse5 (* 8 v_main_~i~0_263) v_main_~j~0_1070 (* v_itHalf_28 44)) 12) (< (+ .cse4 .cse5 (* v_itHalf_28 52) v_main_~j~0_1070 (* 12 v_main_~i~0_263)) 8) (< (+ (* 22 v_main_~i~0_263) .cse4 .cse5 2 v_main_~j~0_1070 (* v_itHalf_28 72)) 0) (< (+ (* 20 v_main_~i~0_263) .cse4 .cse5 v_main_~j~0_1070 (* v_itHalf_28 68)) 0) (< (+ (* 16 v_main_~i~0_263) .cse4 .cse5 v_main_~j~0_1070 (* v_itHalf_28 60)) 4) (< (+ .cse4 .cse5 (* 3 v_main_~i~0_263) v_main_~j~0_1070 (* v_itHalf_28 34)) 17) (< (+ (* v_itHalf_28 70) .cse4 .cse5 (* 21 v_main_~i~0_263) v_main_~j~0_1070 1) 0) (< (+ .cse4 .cse5 v_main_~j~0_1070 (* v_itHalf_28 32) (* 2 v_main_~i~0_263)) 18) (< (+ .cse4 .cse5 (* v_itHalf_28 46) (* 9 v_main_~i~0_263) v_main_~j~0_1070) 11) (< (+ .cse4 .cse5 (* v_itHalf_28 36) v_main_~j~0_1070 (* 4 v_main_~i~0_263)) 16) (<= (+ (* v_itHalf_28 2) v_main_~i~0_263) 100) (< (+ .cse4 .cse5 v_main_~j~0_1070 (* 66 v_itHalf_28) (* 19 v_main_~i~0_263)) 1) (< (+ (* 25 v_main_~i~0_263) .cse4 (* v_itHalf_28 78) .cse5 5 v_main_~j~0_1070) 0) (<= 0 (+ (* 28 v_main_~i~0_263) .cse4 .cse5 (* v_itHalf_28 84) v_main_~j~0_1070 8)) (< (+ .cse4 .cse5 v_main_~j~0_1070 (* v_itHalf_28 50) (* 11 v_main_~i~0_263)) 9) (< (+ .cse4 .cse5 v_main_~j~0_1070 v_main_~i~0_263 (* v_itHalf_28 30)) 19) (< (+ .cse4 .cse5 v_main_~j~0_1070 (* 15 v_main_~i~0_263) (* v_itHalf_28 58)) 5) (< (+ (* v_itHalf_28 82) 7 .cse4 .cse5 v_main_~j~0_1070 (* 27 v_main_~i~0_263)) 0) (< (+ .cse4 .cse5 v_main_~j~0_1070 (* v_main_~i~0_263 24) (* 76 v_itHalf_28) 4) 0) (< (+ .cse4 .cse5 v_main_~j~0_1070 (* 40 v_itHalf_28) (* 6 v_main_~i~0_263)) 14) (< (+ .cse4 .cse5 (* v_itHalf_28 48) v_main_~j~0_1070 (* 10 v_main_~i~0_263)) 10) (< (+ (* 18 v_main_~i~0_263) .cse4 .cse5 v_main_~j~0_1070 (* v_itHalf_28 64)) 2) (< (+ .cse4 .cse5 (* 23 v_main_~i~0_263) 3 v_main_~j~0_1070 (* v_itHalf_28 74)) 0) (< (+ .cse4 .cse5 v_main_~j~0_1070 (* v_itHalf_28 42) (* 7 v_main_~i~0_263)) 13) (< (+ (* 26 v_main_~i~0_263) .cse4 (* v_itHalf_28 80) .cse5 6 v_main_~j~0_1070) 0) (< (+ .cse4 .cse5 v_main_~j~0_1070 (* 5 v_main_~i~0_263) (* v_itHalf_28 38)) 15) (< (+ .cse4 .cse5 (* 17 v_main_~i~0_263) (* v_itHalf_28 62) v_main_~j~0_1070) 3) (< (+ .cse4 .cse5 (* 14 v_main_~i~0_263) v_main_~j~0_1070 (* 56 v_itHalf_28)) 6) (< (+ .cse4 .cse5 v_main_~j~0_1070 (* v_itHalf_28 28)) 20) (< (+ .cse4 .cse5 v_main_~j~0_1070 (* 13 v_main_~i~0_263) (* v_itHalf_28 54)) 7))) (not (<= 1 v_itHalf_28)))) .cse6 .cse7 (= v_main_~j~0_1042 (+ .cse8 (* 56 (* .cse3 .cse3)) v_main_~j~0_1070 (* 56 (* .cse3 v_main_~i~0_263)) (* 84 .cse3) 28)) (= v_main_~k~0_123 4))) (and .cse0 (= v_main_~k~0_123 v_main_~k~0_124) .cse1 (or (not .cse7) (not .cse2) (not .cse6)))))) InVars {main_~i~0=v_main_~i~0_263, main_~k~0=v_main_~k~0_124, main_~j~0=v_main_~j~0_1070} OutVars{main_~i~0=v_main_~i~0_262, main_~k~0=v_main_~k~0_123, main_~j~0=v_main_~j~0_1042} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {8221#(<= main_~i~0 0)} is VALID [2022-04-15 06:24:06,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {8221#(<= main_~i~0 0)} [134] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {8198#false} is VALID [2022-04-15 06:24:06,285 INFO L272 TraceCheckUtils]: 8: Hoare triple {8198#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {8198#false} is VALID [2022-04-15 06:24:06,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {8198#false} ~cond := #in~cond; {8198#false} is VALID [2022-04-15 06:24:06,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {8198#false} assume 0 == ~cond; {8198#false} is VALID [2022-04-15 06:24:06,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {8198#false} assume !false; {8198#false} is VALID [2022-04-15 06:24:06,285 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:24:06,285 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:24:06,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:24:06,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151265223] [2022-04-15 06:24:06,285 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:24:06,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930676898] [2022-04-15 06:24:06,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930676898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:24:06,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:24:06,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:24:13,611 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:24:13,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [416278557] [2022-04-15 06:24:13,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [416278557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:24:13,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:24:13,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 06:24:13,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545572140] [2022-04-15 06:24:13,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:24:13,613 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 2 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 43 [2022-04-15 06:24:13,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:24:13,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 2 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:24:13,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:24:13,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 06:24:13,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:24:13,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 06:24:13,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=991, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 06:24:13,672 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 32 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 2 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:24:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:24:26,823 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-04-15 06:24:26,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 06:24:26,823 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 2 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 43 [2022-04-15 06:24:26,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:24:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 2 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:24:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 59 transitions. [2022-04-15 06:24:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 2 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:24:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 59 transitions. [2022-04-15 06:24:26,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 59 transitions. [2022-04-15 06:24:26,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:24:26,908 INFO L225 Difference]: With dead ends: 54 [2022-04-15 06:24:26,909 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 06:24:26,909 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=994, Invalid=2788, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 06:24:26,910 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:24:26,910 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 375 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:24:26,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 06:24:27,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 06:24:27,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:24:27,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 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:24:27,122 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 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:24:27,122 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 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:24:27,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:24:27,122 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-15 06:24:27,122 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 06:24:27,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:24:27,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:24:27,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 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 45 states. [2022-04-15 06:24:27,123 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 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 45 states. [2022-04-15 06:24:27,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:24:27,123 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-15 06:24:27,123 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 06:24:27,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:24:27,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:24:27,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:24:27,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:24:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 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:24:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-15 06:24:27,124 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 43 [2022-04-15 06:24:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:24:27,124 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-15 06:24:27,124 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 2 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:24:27,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 47 transitions. [2022-04-15 06:24:27,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:24:27,602 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 06:24:27,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 06:24:27,602 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:24:27,602 INFO L499 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:24:27,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 06:24:27,811 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:24:27,812 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:24:27,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:24:27,812 INFO L85 PathProgramCache]: Analyzing trace with hash -373171660, now seen corresponding path program 29 times [2022-04-15 06:24:27,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:24:27,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [223226145] [2022-04-15 06:24:34,010 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:24:38,584 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:24:46,318 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:24:46,908 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:24:55,416 WARN L232 SmtUtils]: Spent 5.87s on a formula simplification. DAG size of input: 507 DAG size of output: 234 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-15 06:24:55,458 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:24:55,471 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:24:55,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1879539642, now seen corresponding path program 1 times [2022-04-15 06:24:55,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:24:55,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992803548] [2022-04-15 06:24:55,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:24:55,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:24:55,502 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:24:55,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [705361121] [2022-04-15 06:24:55,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:24:55,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:24:55,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:24:55,503 INFO L229 MonitoredProcess]: Starting monitored process 30 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:24:55,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 06:24:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:24:55,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:24:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:24:55,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:24:56,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {8611#true} call ULTIMATE.init(); {8611#true} is VALID [2022-04-15 06:24:56,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {8611#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8611#true} is VALID [2022-04-15 06:24:56,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {8611#true} assume true; {8611#true} is VALID [2022-04-15 06:24:56,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8611#true} {8611#true} #75#return; {8611#true} is VALID [2022-04-15 06:24:56,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {8611#true} call #t~ret1 := main(); {8611#true} is VALID [2022-04-15 06:24:56,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {8611#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {8631#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:24:56,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {8631#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [137] L35-3-->L29-2_primed: Formula: (let ((.cse5 (* 29 v_main_~i~0_272))) (let ((.cse3 (<= 0 (+ .cse5 9 v_main_~j~0_1137))) (.cse4 (< (+ v_main_~j~0_1137 8 (* 28 v_main_~i~0_272)) 0)) (.cse7 (<= v_main_~i~0_272 100)) (.cse0 (= v_main_~k~0_128 v_main_~k~0_127)) (.cse1 (= v_main_~j~0_1137 v_main_~j~0_1108)) (.cse2 (= v_main_~i~0_272 v_main_~i~0_271))) (or (and .cse0 .cse1 .cse2) (let ((.cse6 (div (+ (- 1) (* (- 1) v_main_~i~0_272) v_main_~i~0_271) 2))) (and .cse3 .cse4 (= (+ .cse5 29 (* .cse6 87) v_main_~j~0_1137 (* 58 (* .cse6 .cse6)) (* (* .cse6 v_main_~i~0_272) 58)) v_main_~j~0_1108) (<= 0 .cse6) (= v_main_~k~0_127 4) .cse7 (forall ((v_itHalf_29 Int)) (or (not (<= v_itHalf_29 (div (+ (- 1) (* (- 1) v_main_~i~0_272) v_main_~i~0_271) 2))) (not (<= 1 v_itHalf_29)) (let ((.cse8 (* 58 (* v_itHalf_29 v_itHalf_29))) (.cse9 (* (* v_itHalf_29 v_main_~i~0_272) 58))) (and (< (+ (* 53 v_itHalf_29) (* 12 v_main_~i~0_272) v_main_~j~0_1137 .cse8 .cse9) 8) (< (+ (* v_itHalf_29 33) v_main_~j~0_1137 .cse8 .cse9 (* 2 v_main_~i~0_272)) 18) (< (+ (* v_itHalf_29 37) v_main_~j~0_1137 .cse8 .cse9 (* 4 v_main_~i~0_272)) 16) (< (+ (* 7 v_main_~i~0_272) v_main_~j~0_1137 .cse8 .cse9 (* v_itHalf_29 43)) 13) (< (+ v_main_~j~0_1137 .cse8 .cse9 (* v_itHalf_29 49) (* 10 v_main_~i~0_272)) 10) (< (+ (* v_itHalf_29 29) v_main_~j~0_1137 .cse8 .cse9) 20) (< (+ (* 11 v_main_~i~0_272) v_main_~j~0_1137 .cse8 .cse9 (* v_itHalf_29 51)) 9) (< (+ v_main_~j~0_1137 .cse8 .cse9 (* 15 v_main_~i~0_272) (* v_itHalf_29 59)) 5) (< (+ (* 77 v_itHalf_29) (* v_main_~i~0_272 24) v_main_~j~0_1137 .cse8 .cse9 4) 0) (< (+ (* 22 v_main_~i~0_272) (* v_itHalf_29 73) 2 v_main_~j~0_1137 .cse8 .cse9) 0) (< (+ (* v_itHalf_29 39) (* 5 v_main_~i~0_272) v_main_~j~0_1137 .cse8 .cse9) 15) (< (+ 7 (* 27 v_main_~i~0_272) v_main_~j~0_1137 .cse8 (* v_itHalf_29 83) .cse9) 0) (< (+ 5 v_main_~j~0_1137 .cse8 (* 25 v_main_~i~0_272) (* v_itHalf_29 79) .cse9) 0) (< (+ (* v_itHalf_29 81) 6 v_main_~j~0_1137 .cse8 .cse9 (* 26 v_main_~i~0_272)) 0) (< (+ (* 19 v_main_~i~0_272) v_main_~j~0_1137 .cse8 .cse9 (* v_itHalf_29 67)) 1) (< (+ v_main_~j~0_1137 (* 20 v_main_~i~0_272) .cse8 .cse9 (* v_itHalf_29 69)) 0) (< (+ v_main_~j~0_1137 .cse8 (* 9 v_main_~i~0_272) .cse9 (* v_itHalf_29 47)) 11) (< (+ (* v_itHalf_29 71) v_main_~j~0_1137 .cse8 .cse9 (* 21 v_main_~i~0_272) 1) 0) (<= 0 (+ (* 29 v_main_~i~0_272) 9 (* v_itHalf_29 87) v_main_~j~0_1137 .cse8 .cse9)) (< (+ (* v_itHalf_29 85) v_main_~j~0_1137 .cse8 8 .cse9 (* 28 v_main_~i~0_272)) 0) (< (+ (* 3 v_main_~i~0_272) v_main_~j~0_1137 .cse8 .cse9 (* v_itHalf_29 35)) 17) (< (+ (* v_itHalf_29 57) (* 14 v_main_~i~0_272) v_main_~j~0_1137 .cse8 .cse9) 6) (< (+ (* 6 v_main_~i~0_272) (* 41 v_itHalf_29) v_main_~j~0_1137 .cse8 .cse9) 14) (< (+ (* v_itHalf_29 55) v_main_~j~0_1137 .cse8 .cse9 (* 13 v_main_~i~0_272)) 7) (<= (+ (* v_itHalf_29 2) v_main_~i~0_272) 100) (< (+ (* v_itHalf_29 31) v_main_~j~0_1137 .cse8 .cse9 v_main_~i~0_272) 19) (< (+ (* 17 v_main_~i~0_272) (* v_itHalf_29 63) v_main_~j~0_1137 .cse8 .cse9) 3) (< (+ (* v_itHalf_29 65) v_main_~j~0_1137 .cse8 (* 18 v_main_~i~0_272) .cse9) 2) (< (+ (* 8 v_main_~i~0_272) v_main_~j~0_1137 .cse8 .cse9 (* v_itHalf_29 45)) 12) (< (+ (* 16 v_main_~i~0_272) v_main_~j~0_1137 .cse8 .cse9 (* v_itHalf_29 61)) 4) (< (+ (* 23 v_main_~i~0_272) 3 v_main_~j~0_1137 (* v_itHalf_29 75) .cse8 .cse9) 0))))) (= (mod (+ v_main_~i~0_272 v_main_~i~0_271 1) 2) 0))) (and (or (not .cse3) (not .cse4) (not .cse7)) .cse0 .cse1 .cse2)))) InVars {main_~i~0=v_main_~i~0_272, main_~k~0=v_main_~k~0_128, main_~j~0=v_main_~j~0_1137} OutVars{main_~i~0=v_main_~i~0_271, main_~k~0=v_main_~k~0_127, main_~j~0=v_main_~j~0_1108} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {8635#(<= main_~i~0 0)} is VALID [2022-04-15 06:24:56,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {8635#(<= main_~i~0 0)} [136] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {8612#false} is VALID [2022-04-15 06:24:56,443 INFO L272 TraceCheckUtils]: 8: Hoare triple {8612#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {8612#false} is VALID [2022-04-15 06:24:56,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {8612#false} ~cond := #in~cond; {8612#false} is VALID [2022-04-15 06:24:56,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {8612#false} assume 0 == ~cond; {8612#false} is VALID [2022-04-15 06:24:56,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {8612#false} assume !false; {8612#false} is VALID [2022-04-15 06:24:56,443 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:24:56,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:24:56,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:24:56,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992803548] [2022-04-15 06:24:56,444 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:24:56,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705361121] [2022-04-15 06:24:56,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705361121] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:24:56,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:24:56,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:25:04,788 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:25:04,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [223226145] [2022-04-15 06:25:04,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [223226145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:25:04,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:25:04,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 06:25:04,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760780594] [2022-04-15 06:25:04,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:25:04,789 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (3), 2 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 44 [2022-04-15 06:25:04,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:25:04,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (3), 2 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:25:04,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:25:04,846 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 06:25:04,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:25:04,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 06:25:04,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 06:25:04,847 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (3), 2 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:25:21,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:25:21,797 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-04-15 06:25:21,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 06:25:21,797 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (3), 2 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 44 [2022-04-15 06:25:21,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:25:21,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (3), 2 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:25:21,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 60 transitions. [2022-04-15 06:25:21,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (3), 2 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:25:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 60 transitions. [2022-04-15 06:25:21,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 60 transitions. [2022-04-15 06:25:21,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:25:21,886 INFO L225 Difference]: With dead ends: 55 [2022-04-15 06:25:21,886 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 06:25:21,887 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=1058, Invalid=2974, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 06:25:21,887 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:25:21,887 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:25:21,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 06:25:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-15 06:25:22,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:25:22,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 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:25:22,120 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 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:25:22,120 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 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:25:22,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:25:22,120 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-04-15 06:25:22,121 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-04-15 06:25:22,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:25:22,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:25:22,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 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 46 states. [2022-04-15 06:25:22,121 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 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 46 states. [2022-04-15 06:25:22,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:25:22,121 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-04-15 06:25:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-04-15 06:25:22,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:25:22,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:25:22,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:25:22,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:25:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 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:25:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2022-04-15 06:25:22,122 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 44 [2022-04-15 06:25:22,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:25:22,123 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-04-15 06:25:22,123 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 2 states have call successors, (3), 2 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:25:22,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 48 transitions. [2022-04-15 06:25:22,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:25:22,764 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-04-15 06:25:22,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 06:25:22,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:25:22,765 INFO L499 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:25:22,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 06:25:22,965 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:25:22,965 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:25:22,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:25:22,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1203856997, now seen corresponding path program 30 times [2022-04-15 06:25:22,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:25:22,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [361764052] [2022-04-15 06:25:23,121 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:25:27,954 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:25:34,344 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:25:34,965 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:25:43,469 WARN L232 SmtUtils]: Spent 5.45s on a formula simplification. DAG size of input: 524 DAG size of output: 265 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-15 06:25:43,514 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:25:43,526 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:25:43,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1938644986, now seen corresponding path program 1 times [2022-04-15 06:25:43,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:25:43,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657311626] [2022-04-15 06:25:43,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:25:43,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:25:43,556 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:25:43,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [271845617] [2022-04-15 06:25:43,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:25:43,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:25:43,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:25:43,557 INFO L229 MonitoredProcess]: Starting monitored process 31 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:25:43,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 06:25:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:25:43,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:25:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:25:43,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:25:44,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {9034#true} call ULTIMATE.init(); {9034#true} is VALID [2022-04-15 06:25:44,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {9034#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {9034#true} is VALID [2022-04-15 06:25:44,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {9034#true} assume true; {9034#true} is VALID [2022-04-15 06:25:44,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9034#true} {9034#true} #75#return; {9034#true} is VALID [2022-04-15 06:25:44,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {9034#true} call #t~ret1 := main(); {9034#true} is VALID [2022-04-15 06:25:44,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {9034#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {9054#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:25:44,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {9054#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [139] L35-3-->L29-2_primed: Formula: (let ((.cse2 (* 30 v_main_~i~0_281))) (let ((.cse6 (<= 0 (+ v_main_~j~0_1206 .cse2 10))) (.cse5 (<= v_main_~i~0_281 100)) (.cse0 (< (+ 9 v_main_~j~0_1206 (* 29 v_main_~i~0_281)) 0)) (.cse7 (= v_main_~i~0_281 v_main_~i~0_280)) (.cse8 (= v_main_~k~0_132 v_main_~k~0_131)) (.cse9 (= v_main_~j~0_1206 v_main_~j~0_1176))) (or (let ((.cse1 (div (+ (- 1) v_main_~i~0_280 (* (- 1) v_main_~i~0_281)) 2))) (and .cse0 (= (mod (+ v_main_~i~0_281 v_main_~i~0_280 1) 2) 0) (<= 0 .cse1) (= v_main_~k~0_131 4) (= (+ (* (* .cse1 v_main_~i~0_281) 60) 30 (* .cse1 90) v_main_~j~0_1206 (* 60 (* .cse1 .cse1)) .cse2) v_main_~j~0_1176) (forall ((v_itHalf_30 Int)) (or (not (<= 0 v_itHalf_30)) (not (<= (+ v_itHalf_30 1) (div (+ (- 1) v_main_~i~0_280 (* (- 1) v_main_~i~0_281)) 2))) (let ((.cse3 (* (* v_itHalf_30 v_main_~i~0_281) 60)) (.cse4 (* (* v_itHalf_30 v_itHalf_30) 60))) (and (< (+ (* 45 v_main_~i~0_281) 40 .cse3 v_main_~j~0_1206 .cse4 (* v_itHalf_30 120)) 0) (< (+ 32 .cse3 v_main_~j~0_1206 .cse4 (* 41 v_main_~i~0_281) (* 112 v_itHalf_30)) 0) (< (+ (* 38 v_main_~i~0_281) .cse3 v_main_~j~0_1206 .cse4 26 (* 106 v_itHalf_30)) 0) (< (+ .cse3 46 (* v_itHalf_30 126) v_main_~j~0_1206 .cse4 (* 48 v_main_~i~0_281)) 0) (< (+ .cse3 v_main_~j~0_1206 (* v_itHalf_30 134) .cse4 (* 52 v_main_~i~0_281) 54) 0) (< (+ .cse3 (* v_main_~i~0_281 50) v_main_~j~0_1206 .cse4 (* v_itHalf_30 130) 50) 0) (< (+ .cse3 v_main_~j~0_1206 .cse4 (* v_itHalf_30 90) (* 30 v_main_~i~0_281) 10) 0) (<= (+ (* v_itHalf_30 2) v_main_~i~0_281) 99) (< (+ (* 46 v_main_~i~0_281) (* v_itHalf_30 122) 42 .cse3 v_main_~j~0_1206 .cse4) 0) (< (+ (* v_itHalf_30 114) .cse3 (* 42 v_main_~i~0_281) v_main_~j~0_1206 .cse4 34) 0) (< (+ .cse3 52 v_main_~j~0_1206 .cse4 (* v_itHalf_30 132) (* 51 v_main_~i~0_281)) 0) (< (+ (* 33 v_main_~i~0_281) 16 .cse3 v_main_~j~0_1206 .cse4 (* v_itHalf_30 96)) 0) (<= 0 (+ .cse3 (* 60 v_main_~i~0_281) v_main_~j~0_1206 .cse4 (* v_itHalf_30 150) 70)) (< (+ (* v_itHalf_30 118) .cse3 v_main_~j~0_1206 .cse4 (* 44 v_main_~i~0_281) 38) 0) (< (+ 30 .cse3 v_main_~j~0_1206 (* v_itHalf_30 110) .cse4 (* 40 v_main_~i~0_281)) 0) (< (+ .cse3 (* v_itHalf_30 108) v_main_~j~0_1206 .cse4 (* 39 v_main_~i~0_281) 28) 0) (< (+ 64 .cse3 v_main_~j~0_1206 (* v_itHalf_30 144) .cse4 (* 57 v_main_~i~0_281)) 0) (< (+ (* 92 v_itHalf_30) .cse3 v_main_~j~0_1206 (* 31 v_main_~i~0_281) .cse4 12) 0) (< (+ (* v_itHalf_30 100) .cse3 v_main_~j~0_1206 .cse4 (* 35 v_main_~i~0_281) 20) 0) (< (+ (* v_itHalf_30 148) 68 .cse3 v_main_~j~0_1206 .cse4 (* 59 v_main_~i~0_281)) 0) (< (+ (* v_itHalf_30 142) .cse3 62 v_main_~j~0_1206 .cse4 (* 56 v_main_~i~0_281)) 0) (< (+ (* 49 v_main_~i~0_281) .cse3 v_main_~j~0_1206 .cse4 (* v_itHalf_30 128) 48) 0) (< (+ (* v_itHalf_30 98) .cse3 v_main_~j~0_1206 .cse4 (* 34 v_main_~i~0_281) 18) 0) (< (+ 66 (* 58 v_main_~i~0_281) .cse3 v_main_~j~0_1206 .cse4 (* v_itHalf_30 146)) 0) (< (+ (* 55 v_main_~i~0_281) .cse3 v_main_~j~0_1206 .cse4 (* v_itHalf_30 140) 60) 0) (< (+ (* 37 v_main_~i~0_281) .cse3 v_main_~j~0_1206 (* v_itHalf_30 104) .cse4 24) 0) (< (+ (* 43 v_main_~i~0_281) .cse3 (* 116 v_itHalf_30) v_main_~j~0_1206 .cse4 36) 0) (< (+ 56 .cse3 v_main_~j~0_1206 .cse4 (* 53 v_main_~i~0_281) (* v_itHalf_30 136)) 0) (< (+ (* 54 v_main_~i~0_281) .cse3 v_main_~j~0_1206 .cse4 58 (* 138 v_itHalf_30)) 0) (< (+ .cse3 22 v_main_~j~0_1206 .cse4 (* 36 v_main_~i~0_281) (* v_itHalf_30 102)) 0) (< (+ .cse3 14 v_main_~j~0_1206 .cse4 (* v_itHalf_30 94) (* 32 v_main_~i~0_281)) 0) (< (+ (* v_itHalf_30 124) 44 .cse3 v_main_~j~0_1206 .cse4 (* 47 v_main_~i~0_281)) 0))))) .cse5 .cse6)) (and .cse7 .cse8 .cse9) (and (or (not .cse6) (not .cse5) (not .cse0)) .cse7 .cse8 .cse9)))) InVars {main_~i~0=v_main_~i~0_281, main_~k~0=v_main_~k~0_132, main_~j~0=v_main_~j~0_1206} OutVars{main_~i~0=v_main_~i~0_280, main_~k~0=v_main_~k~0_131, main_~j~0=v_main_~j~0_1176} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {9058#(<= main_~i~0 0)} is VALID [2022-04-15 06:25:44,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {9058#(<= main_~i~0 0)} [138] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {9035#false} is VALID [2022-04-15 06:25:44,546 INFO L272 TraceCheckUtils]: 8: Hoare triple {9035#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {9035#false} is VALID [2022-04-15 06:25:44,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {9035#false} ~cond := #in~cond; {9035#false} is VALID [2022-04-15 06:25:44,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {9035#false} assume 0 == ~cond; {9035#false} is VALID [2022-04-15 06:25:44,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {9035#false} assume !false; {9035#false} is VALID [2022-04-15 06:25:44,547 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:25:44,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:25:44,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:25:44,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657311626] [2022-04-15 06:25:44,547 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:25:44,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271845617] [2022-04-15 06:25:44,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271845617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:25:44,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:25:44,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:25:56,044 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:25:56,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [361764052] [2022-04-15 06:25:56,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [361764052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:25:56,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:25:56,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 06:25:56,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585747783] [2022-04-15 06:25:56,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:25:56,045 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 2 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 45 [2022-04-15 06:25:56,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:25:56,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 2 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:25:56,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:25:56,105 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 06:25:56,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:25:56,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 06:25:56,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 06:25:56,106 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 34 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 2 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:26:15,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:15,397 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-15 06:26:15,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 06:26:15,397 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 2 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 45 [2022-04-15 06:26:15,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:26:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 2 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:26:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 61 transitions. [2022-04-15 06:26:15,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 2 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:26:15,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 61 transitions. [2022-04-15 06:26:15,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 61 transitions. [2022-04-15 06:26:15,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:15,502 INFO L225 Difference]: With dead ends: 56 [2022-04-15 06:26:15,502 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 06:26:15,503 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=1124, Invalid=3166, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 06:26:15,504 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:26:15,504 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 399 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:26:15,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 06:26:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 06:26:15,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:26:15,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 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:26:15,782 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 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:26:15,782 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 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:26:15,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:15,783 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-15 06:26:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 06:26:15,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:15,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:15,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 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 47 states. [2022-04-15 06:26:15,783 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 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 47 states. [2022-04-15 06:26:15,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:15,784 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-15 06:26:15,784 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 06:26:15,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:15,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:15,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:26:15,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:26:15,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 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:26:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-15 06:26:15,785 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 45 [2022-04-15 06:26:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:26:15,785 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-15 06:26:15,785 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 2 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:26:15,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2022-04-15 06:26:16,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 06:26:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 06:26:16,416 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:26:16,416 INFO L499 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:26:16,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 06:26:16,616 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-15 06:26:16,616 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:26:16,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:26:16,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1185298668, now seen corresponding path program 31 times [2022-04-15 06:26:16,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:16,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1427754199] [2022-04-15 06:26:18,803 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:26:23,387 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:26:25,774 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 06:26:26,352 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:26:34,188 WARN L232 SmtUtils]: Spent 5.09s on a formula simplification. DAG size of input: 536 DAG size of output: 246 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-15 06:26:34,236 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:26:34,249 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:26:34,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1997750330, now seen corresponding path program 1 times [2022-04-15 06:26:34,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:26:34,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164264260] [2022-04-15 06:26:34,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:34,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:26:34,281 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:26:34,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [716843499] [2022-04-15 06:26:34,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:34,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:26:34,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:26:34,282 INFO L229 MonitoredProcess]: Starting monitored process 32 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:26:34,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 06:26:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:34,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:26:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:34,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:26:35,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {9466#true} call ULTIMATE.init(); {9466#true} is VALID [2022-04-15 06:26:35,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {9466#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {9466#true} is VALID [2022-04-15 06:26:35,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {9466#true} assume true; {9466#true} is VALID [2022-04-15 06:26:35,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9466#true} {9466#true} #75#return; {9466#true} is VALID [2022-04-15 06:26:35,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {9466#true} call #t~ret1 := main(); {9466#true} is VALID [2022-04-15 06:26:35,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {9466#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {9486#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2022-04-15 06:26:35,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {9486#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} [141] L35-3-->L29-2_primed: Formula: (let ((.cse3 (* 31 v_main_~i~0_290))) (let ((.cse5 (<= 0 (+ v_main_~j~0_1277 .cse3 11))) (.cse1 (<= v_main_~i~0_290 100)) (.cse4 (< (+ (* 30 v_main_~i~0_290) v_main_~j~0_1277 10) 0)) (.cse0 (= v_main_~k~0_136 v_main_~k~0_135))) (or (and .cse0 (= v_main_~j~0_1277 v_main_~j~0_1246) (= v_main_~i~0_290 v_main_~i~0_289)) (let ((.cse2 (div (+ (* (- 1) v_main_~i~0_290) (- 1) v_main_~i~0_289) 2))) (and .cse1 (= v_main_~j~0_1246 (+ (* 62 (* .cse2 v_main_~i~0_290)) (* .cse2 93) 31 v_main_~j~0_1277 (* 62 (* .cse2 .cse2)) .cse3)) (= (mod (+ v_main_~i~0_289 v_main_~i~0_290 1) 2) 0) .cse4 (= v_main_~k~0_135 4) (<= 0 .cse2) .cse5 (forall ((v_itHalf_31 Int)) (or (not (<= 1 v_itHalf_31)) (not (<= v_itHalf_31 (div (+ (* (- 1) v_main_~i~0_290) (- 1) v_main_~i~0_289) 2))) (let ((.cse6 (* (* v_itHalf_31 v_main_~i~0_290) 62)) (.cse7 (* (* v_itHalf_31 v_itHalf_31) 62))) (and (< (+ .cse6 5 v_main_~j~0_1277 (* v_itHalf_31 81) .cse7 (* 25 v_main_~i~0_290)) 0) (< (+ (* v_itHalf_31 43) .cse6 v_main_~j~0_1277 (* 6 v_main_~i~0_290) .cse7) 14) (< (+ (* 14 v_main_~i~0_290) .cse6 (* v_itHalf_31 59) v_main_~j~0_1277 .cse7) 6) (< (+ (* v_itHalf_31 63) .cse6 (* 16 v_main_~i~0_290) v_main_~j~0_1277 .cse7) 4) (<= (+ (* v_itHalf_31 2) v_main_~i~0_290) 100) (< (+ .cse6 (* v_itHalf_31 49) (* 9 v_main_~i~0_290) v_main_~j~0_1277 .cse7) 11) (< (+ (* 20 v_main_~i~0_290) .cse6 v_main_~j~0_1277 .cse7 (* v_itHalf_31 71)) 0) (< (+ .cse6 v_main_~j~0_1277 .cse7 (* 10 v_main_~i~0_290) (* v_itHalf_31 51)) 10) (<= 0 (+ (* v_itHalf_31 93) .cse6 v_main_~j~0_1277 .cse7 (* 31 v_main_~i~0_290) 11)) (< (+ .cse6 (* 2 v_main_~i~0_290) (* v_itHalf_31 35) v_main_~j~0_1277 .cse7) 18) (< (+ (* 5 v_main_~i~0_290) .cse6 (* 41 v_itHalf_31) v_main_~j~0_1277 .cse7) 15) (< (+ .cse6 v_main_~j~0_1277 (* v_itHalf_31 57) .cse7 (* 13 v_main_~i~0_290)) 7) (< (+ (* 91 v_itHalf_31) .cse6 (* 30 v_main_~i~0_290) v_main_~j~0_1277 .cse7 10) 0) (< (+ (* 77 v_itHalf_31) .cse6 3 v_main_~j~0_1277 .cse7 (* 23 v_main_~i~0_290)) 0) (< (+ .cse6 2 v_main_~j~0_1277 (* 22 v_main_~i~0_290) .cse7 (* v_itHalf_31 75)) 0) (< (+ .cse6 (* v_itHalf_31 69) v_main_~j~0_1277 .cse7 (* 19 v_main_~i~0_290)) 1) (< (+ .cse6 (* 26 v_main_~i~0_290) 6 v_main_~j~0_1277 .cse7 (* v_itHalf_31 83)) 0) (< (+ (* v_itHalf_31 87) .cse6 v_main_~j~0_1277 .cse7 8 (* 28 v_main_~i~0_290)) 0) (< (+ .cse6 v_main_~j~0_1277 (* v_itHalf_31 65) .cse7 (* 17 v_main_~i~0_290)) 3) (< (+ (* 8 v_main_~i~0_290) .cse6 (* v_itHalf_31 47) v_main_~j~0_1277 .cse7) 12) (< (+ .cse6 (* v_itHalf_31 45) v_main_~j~0_1277 .cse7 (* 7 v_main_~i~0_290)) 13) (< (+ (* 53 v_itHalf_31) .cse6 v_main_~j~0_1277 .cse7 (* 11 v_main_~i~0_290)) 9) (< (+ (* v_itHalf_31 85) (* 27 v_main_~i~0_290) 7 .cse6 v_main_~j~0_1277 .cse7) 0) (< (+ .cse6 (* v_main_~i~0_290 24) v_main_~j~0_1277 (* v_itHalf_31 79) .cse7 4) 0) (< (+ (* 29 v_main_~i~0_290) (* v_itHalf_31 89) .cse6 9 v_main_~j~0_1277 .cse7) 0) (< (+ .cse6 v_main_~j~0_1277 (* v_itHalf_31 33) .cse7 v_main_~i~0_290) 19) (< (+ .cse6 (* v_itHalf_31 39) v_main_~j~0_1277 (* 4 v_main_~i~0_290) .cse7) 16) (< (+ (* v_itHalf_31 61) .cse6 (* 15 v_main_~i~0_290) v_main_~j~0_1277 .cse7) 5) (< (+ .cse6 v_main_~j~0_1277 (* v_itHalf_31 31) .cse7) 20) (< (+ .cse6 (* v_itHalf_31 67) v_main_~j~0_1277 (* 18 v_main_~i~0_290) .cse7) 2) (< (+ .cse6 v_main_~j~0_1277 .cse7 (* v_itHalf_31 73) (* 21 v_main_~i~0_290) 1) 0) (< (+ (* v_itHalf_31 37) .cse6 (* 3 v_main_~i~0_290) v_main_~j~0_1277 .cse7) 17) (< (+ (* 12 v_main_~i~0_290) (* v_itHalf_31 55) .cse6 v_main_~j~0_1277 .cse7) 8))))))) (and (or (not .cse5) (not .cse1) (not .cse4)) (= v_main_~j~0_1246 v_main_~j~0_1277) (= v_main_~i~0_289 v_main_~i~0_290) .cse0)))) InVars {main_~i~0=v_main_~i~0_290, main_~k~0=v_main_~k~0_136, main_~j~0=v_main_~j~0_1277} OutVars{main_~i~0=v_main_~i~0_289, main_~k~0=v_main_~k~0_135, main_~j~0=v_main_~j~0_1246} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {9490#(<= main_~i~0 0)} is VALID [2022-04-15 06:26:35,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {9490#(<= main_~i~0 0)} [140] L29-2_primed-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {9467#false} is VALID [2022-04-15 06:26:35,502 INFO L272 TraceCheckUtils]: 8: Hoare triple {9467#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {9467#false} is VALID [2022-04-15 06:26:35,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {9467#false} ~cond := #in~cond; {9467#false} is VALID [2022-04-15 06:26:35,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {9467#false} assume 0 == ~cond; {9467#false} is VALID [2022-04-15 06:26:35,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {9467#false} assume !false; {9467#false} is VALID [2022-04-15 06:26:35,502 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:26:35,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:26:35,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:26:35,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164264260] [2022-04-15 06:26:35,502 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:26:35,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716843499] [2022-04-15 06:26:35,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716843499] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:26:35,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:26:35,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4