/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/nla-digbench-scaling/sqrt1-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:03:28,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:03:28,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:03:28,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:03:28,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:03:28,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:03:28,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:03:28,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:03:28,639 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:03:28,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:03:28,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:03:28,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:03:28,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:03:28,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:03:28,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:03:28,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:03:28,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:03:28,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:03:28,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:03:28,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:03:28,656 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:03:28,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:03:28,658 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:03:28,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:03:28,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:03:28,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:03:28,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:03:28,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:03:28,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:03:28,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:03:28,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:03:28,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:03:28,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:03:28,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:03:28,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:03:28,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:03:28,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:03:28,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:03:28,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:03:28,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:03:28,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:03:28,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:03:28,674 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 11:03:28,681 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:03:28,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:03:28,682 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:03:28,682 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:03:28,682 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:03:28,682 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:03:28,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:03:28,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:03:28,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:03:28,683 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:03:28,683 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:03:28,683 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:03:28,683 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:03:28,684 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:03:28,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:03:28,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:03:28,684 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:03:28,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:03:28,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:03:28,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:03:28,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:03:28,684 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:03:28,685 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:03:28,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:03:28,685 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:03:28,685 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 11:03:28,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:03:28,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:03:28,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:03:28,918 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:03:28,918 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:03:28,919 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound50.c [2022-04-15 11:03:28,986 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8787a05c/8797ae12d2b948a6a0786c4638a2d146/FLAG2cddc2edc [2022-04-15 11:03:29,328 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:03:29,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound50.c [2022-04-15 11:03:29,333 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8787a05c/8797ae12d2b948a6a0786c4638a2d146/FLAG2cddc2edc [2022-04-15 11:03:29,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8787a05c/8797ae12d2b948a6a0786c4638a2d146 [2022-04-15 11:03:29,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:03:29,344 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:03:29,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:03:29,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:03:29,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:03:29,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:03:29" (1/1) ... [2022-04-15 11:03:29,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c96b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:03:29, skipping insertion in model container [2022-04-15 11:03:29,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:03:29" (1/1) ... [2022-04-15 11:03:29,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:03:29,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:03:29,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound50.c[520,533] [2022-04-15 11:03:29,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:03:29,515 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:03:29,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound50.c[520,533] [2022-04-15 11:03:29,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:03:29,551 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:03:29,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:03:29 WrapperNode [2022-04-15 11:03:29,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:03:29,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:03:29,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:03:29,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:03:29,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:03:29" (1/1) ... [2022-04-15 11:03:29,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:03:29" (1/1) ... [2022-04-15 11:03:29,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:03:29" (1/1) ... [2022-04-15 11:03:29,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:03:29" (1/1) ... [2022-04-15 11:03:29,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:03:29" (1/1) ... [2022-04-15 11:03:29,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:03:29" (1/1) ... [2022-04-15 11:03:29,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:03:29" (1/1) ... [2022-04-15 11:03:29,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:03:29,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:03:29,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:03:29,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:03:29,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:03:29" (1/1) ... [2022-04-15 11:03:29,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:03:29,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:03:29,606 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 11:03:29,624 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 11:03:29,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:03:29,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:03:29,639 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:03:29,639 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 11:03:29,639 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 11:03:29,639 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:03:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:03:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:03:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:03:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:03:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:03:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 11:03:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 11:03:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:03:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:03:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:03:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:03:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:03:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:03:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:03:29,688 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:03:29,690 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:03:29,808 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:03:29,812 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:03:29,812 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:03:29,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:03:29 BoogieIcfgContainer [2022-04-15 11:03:29,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:03:29,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:03:29,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:03:29,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:03:29,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:03:29" (1/3) ... [2022-04-15 11:03:29,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e83279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:03:29, skipping insertion in model container [2022-04-15 11:03:29,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:03:29" (2/3) ... [2022-04-15 11:03:29,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e83279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:03:29, skipping insertion in model container [2022-04-15 11:03:29,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:03:29" (3/3) ... [2022-04-15 11:03:29,818 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound50.c [2022-04-15 11:03:29,821 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:03:29,822 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:03:29,846 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:03:29,861 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 11:03:29,861 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:03:29,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 11:03:29,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 11:03:29,886 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:03:29,886 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:03:29,887 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:03:29,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:03:29,895 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 1 times [2022-04-15 11:03:29,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:03:29,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1629296890] [2022-04-15 11:03:29,909 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:03:29,909 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 2 times [2022-04-15 11:03:29,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:03:29,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744334351] [2022-04-15 11:03:29,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:03:29,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:03:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:03:30,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:03:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:03:30,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-04-15 11:03:30,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 11:03:30,095 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-15 11:03:30,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:03:30,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-04-15 11:03:30,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 11:03:30,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-15 11:03:30,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(); {29#true} is VALID [2022-04-15 11:03:30,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {29#true} is VALID [2022-04-15 11:03:30,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-15 11:03:30,098 INFO L272 TraceCheckUtils]: 7: Hoare triple {30#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {30#false} is VALID [2022-04-15 11:03:30,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-15 11:03:30,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-15 11:03:30,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-15 11:03:30,100 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 11:03:30,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:03:30,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744334351] [2022-04-15 11:03:30,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744334351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:03:30,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:03:30,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 11:03:30,106 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:03:30,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1629296890] [2022-04-15 11:03:30,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1629296890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:03:30,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:03:30,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 11:03:30,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875916130] [2022-04-15 11:03:30,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:03:30,111 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 11:03:30,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:03:30,114 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 11:03:30,130 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 11:03:30,130 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 11:03:30,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:03:30,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 11:03:30,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 11:03:30,152 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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 11:03:30,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:30,307 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-15 11:03:30,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 11:03:30,308 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 11:03:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:03:30,309 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 11:03:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-15 11:03:30,325 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 11:03:30,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-15 11:03:30,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-15 11:03:30,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:03:30,416 INFO L225 Difference]: With dead ends: 47 [2022-04-15 11:03:30,416 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 11:03:30,419 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 11:03:30,422 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:03:30,422 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:03:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 11:03:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 11:03:30,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:03:30,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:03:30,443 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:03:30,444 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:03:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:30,447 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-15 11:03:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-15 11:03:30,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:03:30,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:03:30,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-15 11:03:30,448 INFO L87 Difference]: Start difference. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-15 11:03:30,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:30,450 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-15 11:03:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-15 11:03:30,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:03:30,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:03:30,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:03:30,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:03:30,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:03:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-15 11:03:30,454 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-15 11:03:30,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:03:30,454 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-15 11:03:30,454 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 11:03:30,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 27 transitions. [2022-04-15 11:03:30,478 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 11:03:30,478 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-15 11:03:30,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 11:03:30,478 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:03:30,479 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:03:30,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:03:30,479 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:03:30,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:03:30,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 1 times [2022-04-15 11:03:30,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:03:30,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [321630112] [2022-04-15 11:03:30,480 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:03:30,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 2 times [2022-04-15 11:03:30,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:03:30,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317638989] [2022-04-15 11:03:30,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:03:30,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:03:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:03:30,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:03:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:03:30,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {222#(= ~counter~0 0)} is VALID [2022-04-15 11:03:30,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-15 11:03:30,561 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-15 11:03:30,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {224#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:03:30,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {222#(= ~counter~0 0)} is VALID [2022-04-15 11:03:30,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-15 11:03:30,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-15 11:03:30,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {222#(= ~counter~0 0)} call #t~ret6 := main(); {222#(= ~counter~0 0)} is VALID [2022-04-15 11:03:30,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {222#(= ~counter~0 0)} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {222#(= ~counter~0 0)} is VALID [2022-04-15 11:03:30,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {222#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {223#(= |main_#t~post5| 0)} is VALID [2022-04-15 11:03:30,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= |main_#t~post5| 0)} assume !(#t~post5 < 50);havoc #t~post5; {218#false} is VALID [2022-04-15 11:03:30,565 INFO L272 TraceCheckUtils]: 8: Hoare triple {218#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {218#false} is VALID [2022-04-15 11:03:30,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#false} ~cond := #in~cond; {218#false} is VALID [2022-04-15 11:03:30,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#false} assume 0 == ~cond; {218#false} is VALID [2022-04-15 11:03:30,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-04-15 11:03:30,565 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 11:03:30,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:03:30,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317638989] [2022-04-15 11:03:30,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317638989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:03:30,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:03:30,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:03:30,566 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:03:30,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [321630112] [2022-04-15 11:03:30,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [321630112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:03:30,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:03:30,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:03:30,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449367073] [2022-04-15 11:03:30,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:03:30,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 12 [2022-04-15 11:03:30,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:03:30,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 11:03:30,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:03:30,577 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:03:30,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:03:30,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:03:30,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:03:30,578 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 11:03:30,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:30,723 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-15 11:03:30,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:03:30,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 12 [2022-04-15 11:03:30,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:03:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 11:03:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 11:03:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 11:03:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 11:03:30,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-15 11:03:30,758 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 11:03:30,759 INFO L225 Difference]: With dead ends: 32 [2022-04-15 11:03:30,760 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 11:03:30,760 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:03:30,761 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:03:30,761 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:03:30,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 11:03:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 11:03:30,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:03:30,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:03:30,766 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:03:30,766 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:03:30,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:30,768 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 11:03:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 11:03:30,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:03:30,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:03:30,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-15 11:03:30,769 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-15 11:03:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:30,770 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 11:03:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 11:03:30,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:03:30,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:03:30,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:03:30,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:03:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:03:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-15 11:03:30,773 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-15 11:03:30,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:03:30,773 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-15 11:03:30,773 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 11:03:30,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 29 transitions. [2022-04-15 11:03:30,797 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 11:03:30,798 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 11:03:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 11:03:30,798 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:03:30,798 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:03:30,798 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:03:30,799 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:03:30,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:03:30,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 1 times [2022-04-15 11:03:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:03:30,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2076324524] [2022-04-15 11:03:30,800 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:03:30,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 2 times [2022-04-15 11:03:30,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:03:30,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056681655] [2022-04-15 11:03:30,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:03:30,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:03:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:03:30,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:03:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:03:30,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {393#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {385#true} is VALID [2022-04-15 11:03:30,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 11:03:30,877 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-15 11:03:30,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {393#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:03:30,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {385#true} is VALID [2022-04-15 11:03:30,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 11:03:30,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-15 11:03:30,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-15 11:03:30,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-15 11:03:30,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-15 11:03:30,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !!(#t~post5 < 50);havoc #t~post5; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-15 11:03:30,888 INFO L272 TraceCheckUtils]: 8: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {391#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 11:03:30,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {392#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 11:03:30,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {386#false} is VALID [2022-04-15 11:03:30,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 11:03:30,890 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 11:03:30,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:03:30,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056681655] [2022-04-15 11:03:30,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056681655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:03:30,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:03:30,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:03:30,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:03:30,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2076324524] [2022-04-15 11:03:30,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2076324524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:03:30,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:03:30,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:03:30,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046427807] [2022-04-15 11:03:30,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:03:30,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 11:03:30,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:03:30,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:03:30,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:03:30,907 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:03:30,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:03:30,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:03:30,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:03:30,909 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:03:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:31,207 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-15 11:03:31,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 11:03:31,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 11:03:31,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:03:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:03:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 11:03:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:03:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 11:03:31,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-15 11:03:31,249 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 11:03:31,250 INFO L225 Difference]: With dead ends: 36 [2022-04-15 11:03:31,251 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 11:03:31,251 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:03:31,252 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:03:31,252 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 53 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:03:31,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 11:03:31,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-15 11:03:31,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:03:31,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 11:03:31,258 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 11:03:31,258 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 11:03:31,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:31,260 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-15 11:03:31,260 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-15 11:03:31,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:03:31,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:03:31,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-15 11:03:31,261 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-15 11:03:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:31,263 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-15 11:03:31,263 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-15 11:03:31,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:03:31,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:03:31,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:03:31,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:03:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 11:03:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-15 11:03:31,266 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-15 11:03:31,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:03:31,266 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-15 11:03:31,266 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:03:31,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-15 11:03:31,305 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 11:03:31,305 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 11:03:31,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 11:03:31,307 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:03:31,307 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:03:31,307 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:03:31,309 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:03:31,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:03:31,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 1 times [2022-04-15 11:03:31,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:03:31,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1955228206] [2022-04-15 11:03:31,312 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:03:31,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 2 times [2022-04-15 11:03:31,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:03:31,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68347221] [2022-04-15 11:03:31,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:03:31,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:03:31,323 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:03:31,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1564030001] [2022-04-15 11:03:31,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:03:31,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:03:31,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:03:31,332 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 11:03:31,361 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 11:03:31,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:03:31,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:03:31,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 11:03:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:03:31,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:03:31,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2022-04-15 11:03:31,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {608#true} is VALID [2022-04-15 11:03:31,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-15 11:03:31,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #66#return; {608#true} is VALID [2022-04-15 11:03:31,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret6 := main(); {608#true} is VALID [2022-04-15 11:03:31,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {608#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-15 11:03:31,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-15 11:03:31,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-15 11:03:31,530 INFO L272 TraceCheckUtils]: 8: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {608#true} is VALID [2022-04-15 11:03:31,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {608#true} ~cond := #in~cond; {608#true} is VALID [2022-04-15 11:03:31,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {608#true} assume !(0 == ~cond); {608#true} is VALID [2022-04-15 11:03:31,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-15 11:03:31,531 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {608#true} {628#(and (= main_~a~0 0) (= main_~s~0 1))} #54#return; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-15 11:03:31,532 INFO L272 TraceCheckUtils]: 13: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {653#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 11:03:31,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {657#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:03:31,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {657#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {609#false} is VALID [2022-04-15 11:03:31,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-04-15 11:03:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:03:31,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 11:03:31,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:03:31,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68347221] [2022-04-15 11:03:31,534 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:03:31,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564030001] [2022-04-15 11:03:31,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564030001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:03:31,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:03:31,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:03:31,535 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:03:31,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1955228206] [2022-04-15 11:03:31,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1955228206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:03:31,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:03:31,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:03:31,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391929344] [2022-04-15 11:03:31,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:03:31,536 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-15 11:03:31,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:03:31,536 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 11:03:31,549 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 11:03:31,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:03:31,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:03:31,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:03:31,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:03:31,550 INFO L87 Difference]: Start difference. First operand 32 states and 42 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 11:03:31,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:31,687 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-15 11:03:31,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:03:31,687 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-15 11:03:31,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:03:31,688 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 11:03:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 11:03:31,690 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 11:03:31,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 11:03:31,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-15 11:03:31,725 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 11:03:31,728 INFO L225 Difference]: With dead ends: 40 [2022-04-15 11:03:31,728 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 11:03:31,728 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:03:31,731 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:03:31,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:03:31,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 11:03:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-15 11:03:31,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:03:31,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 11:03:31,760 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 11:03:31,761 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 11:03:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:31,775 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-15 11:03:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-15 11:03:31,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:03:31,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:03:31,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-15 11:03:31,777 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-15 11:03:31,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:31,779 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-15 11:03:31,779 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-15 11:03:31,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:03:31,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:03:31,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:03:31,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:03:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 11:03:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-15 11:03:31,781 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 17 [2022-04-15 11:03:31,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:03:31,781 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-15 11:03:31,781 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 11:03:31,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 47 transitions. [2022-04-15 11:03:31,825 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 11:03:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-15 11:03:31,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 11:03:31,826 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:03:31,826 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:03:31,845 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 11:03:32,027 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 11:03:32,028 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:03:32,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:03:32,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 1 times [2022-04-15 11:03:32,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:03:32,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [635884671] [2022-04-15 11:03:32,029 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:03:32,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 2 times [2022-04-15 11:03:32,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:03:32,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566441258] [2022-04-15 11:03:32,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:03:32,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:03:32,038 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:03:32,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [577295920] [2022-04-15 11:03:32,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:03:32,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:03:32,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:03:32,039 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 11:03:32,043 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 11:03:32,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:03:32,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:03:32,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 11:03:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:03:32,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:03:32,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {895#true} call ULTIMATE.init(); {895#true} is VALID [2022-04-15 11:03:32,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {895#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {895#true} is VALID [2022-04-15 11:03:32,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-15 11:03:32,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {895#true} {895#true} #66#return; {895#true} is VALID [2022-04-15 11:03:32,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {895#true} call #t~ret6 := main(); {895#true} is VALID [2022-04-15 11:03:32,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {895#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 11:03:32,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 11:03:32,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 11:03:32,196 INFO L272 TraceCheckUtils]: 8: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {895#true} is VALID [2022-04-15 11:03:32,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-15 11:03:32,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-15 11:03:32,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-15 11:03:32,197 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {895#true} {915#(and (= main_~t~0 1) (= main_~s~0 1))} #54#return; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 11:03:32,197 INFO L272 TraceCheckUtils]: 13: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {895#true} is VALID [2022-04-15 11:03:32,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-15 11:03:32,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-15 11:03:32,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-15 11:03:32,201 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {895#true} {915#(and (= main_~t~0 1) (= main_~s~0 1))} #56#return; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 11:03:32,201 INFO L272 TraceCheckUtils]: 18: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {955#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 11:03:32,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {955#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {959#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:03:32,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {959#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {896#false} is VALID [2022-04-15 11:03:32,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {896#false} assume !false; {896#false} is VALID [2022-04-15 11:03:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 11:03:32,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 11:03:32,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:03:32,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566441258] [2022-04-15 11:03:32,203 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:03:32,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577295920] [2022-04-15 11:03:32,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577295920] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:03:32,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:03:32,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:03:32,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:03:32,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [635884671] [2022-04-15 11:03:32,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [635884671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:03:32,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:03:32,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:03:32,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245515987] [2022-04-15 11:03:32,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:03:32,204 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 11:03:32,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:03:32,205 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 11:03:32,217 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 11:03:32,217 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:03:32,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:03:32,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:03:32,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:03:32,218 INFO L87 Difference]: Start difference. First operand 37 states and 47 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 11:03:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:32,358 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-15 11:03:32,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:03:32,359 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 11:03:32,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:03:32,359 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 11:03:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 11:03:32,360 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 11:03:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 11:03:32,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-15 11:03:32,394 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 11:03:32,395 INFO L225 Difference]: With dead ends: 44 [2022-04-15 11:03:32,395 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 11:03:32,396 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:03:32,396 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:03:32,396 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:03:32,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 11:03:32,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 11:03:32,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:03:32,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 11:03:32,407 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 11:03:32,407 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 11:03:32,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:32,409 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-15 11:03:32,409 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-15 11:03:32,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:03:32,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:03:32,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-15 11:03:32,410 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-15 11:03:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:32,411 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-15 11:03:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-15 11:03:32,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:03:32,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:03:32,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:03:32,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:03:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 11:03:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-15 11:03:32,413 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-04-15 11:03:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:03:32,413 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-15 11:03:32,413 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 11:03:32,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 45 transitions. [2022-04-15 11:03:32,448 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 11:03:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-15 11:03:32,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:03:32,449 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:03:32,449 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:03:32,468 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 11:03:32,663 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 11:03:32,664 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:03:32,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:03:32,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 1 times [2022-04-15 11:03:32,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:03:32,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1879697051] [2022-04-15 11:03:37,124 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=2, 3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:03:37,128 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:03:37,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1831963292, now seen corresponding path program 1 times [2022-04-15 11:03:37,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:03:37,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355997076] [2022-04-15 11:03:37,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:03:37,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:03:37,146 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:03:37,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [436626145] [2022-04-15 11:03:37,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:03:37,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:03:37,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:03:37,147 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 11:03:37,183 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 11:03:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:03:37,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 11:03:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:03:37,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:04:21,596 WARN L833 $PredicateComparison]: unable to prove that (exists ((aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 Int) (aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 Int) (main_~n~0 Int) (aux_div_v_main_~t~0_BEFORE_CALL_6_53 Int) (main_~s~0 Int)) (let ((.cse2 (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 4)) (.cse5 (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4))) (let ((.cse1 (+ .cse2 .cse5)) (.cse0 (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 4))) (and (<= .cse0 .cse1) (<= main_~s~0 (+ .cse2 main_~n~0 (* (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 aux_div_v_main_~t~0_BEFORE_CALL_6_53) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (let ((.cse3 (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4))) (and (< (* v_itHalf_1 2) 49) (<= (+ .cse3 main_~s~0 3 (* (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55) 8) (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55) 4) (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 4) (* (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99) 4))) (= (let ((.cse4 (div (+ .cse3 (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 (- 4))) (- 4)))) (+ (* (* .cse4 .cse4) 4) (* .cse4 4) 1)) main_~s~0))) (not (<= (+ v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 1) aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99)))) (<= 1 |c___VERIFIER_assert_#in~cond|) (<= 50 (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 2)) (<= 0 .cse5) (< .cse5 4) (< .cse1 (+ .cse0 4)))))) is different from false [2022-04-15 11:04:26,912 WARN L833 $PredicateComparison]: unable to prove that (and (<= 1 c___VERIFIER_assert_~cond) (exists ((aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 Int) (aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 Int) (main_~n~0 Int) (aux_div_v_main_~t~0_BEFORE_CALL_6_53 Int) (main_~s~0 Int)) (let ((.cse2 (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 4)) (.cse5 (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4))) (let ((.cse1 (+ .cse2 .cse5)) (.cse0 (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 4))) (and (<= .cse0 .cse1) (<= main_~s~0 (+ .cse2 main_~n~0 (* (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 aux_div_v_main_~t~0_BEFORE_CALL_6_53) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (let ((.cse3 (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4))) (and (< (* v_itHalf_1 2) 49) (<= (+ .cse3 main_~s~0 3 (* (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55) 8) (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55) 4) (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 4) (* (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99) 4))) (= (let ((.cse4 (div (+ .cse3 (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 (- 4))) (- 4)))) (+ (* (* .cse4 .cse4) 4) (* .cse4 4) 1)) main_~s~0))) (not (<= (+ v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 1) aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99)))) (<= 50 (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 2)) (<= 0 .cse5) (< .cse5 4) (< .cse1 (+ .cse0 4))))))) is different from false [2022-04-15 11:04:26,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-15 11:04:26,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1219#(= ~counter~0 0)} is VALID [2022-04-15 11:04:26,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {1219#(= ~counter~0 0)} assume true; {1219#(= ~counter~0 0)} is VALID [2022-04-15 11:04:26,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1219#(= ~counter~0 0)} {1211#true} #66#return; {1219#(= ~counter~0 0)} is VALID [2022-04-15 11:04:26,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {1219#(= ~counter~0 0)} call #t~ret6 := main(); {1219#(= ~counter~0 0)} is VALID [2022-04-15 11:04:26,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {1219#(= ~counter~0 0)} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1232#(and (= main_~a~0 0) (= main_~t~0 1) (= ~counter~0 0))} is VALID [2022-04-15 11:04:27,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {1232#(and (= main_~a~0 0) (= main_~t~0 1) (= ~counter~0 0))} [70] L30-3-->L30-1_primed: Formula: (let ((.cse7 (* 2 v_main_~a~0_19))) (let ((.cse6 (< v_~counter~0_9 50)) (.cse4 (<= v_main_~s~0_20 v_main_~n~0_6)) (.cse5 (= v_main_~t~0_19 (+ .cse7 1))) (.cse0 (= |v_main_#t~post5_8| |v_main_#t~post5_6|)) (.cse1 (= v_main_~a~0_19 v_main_~a~0_18)) (.cse2 (= v_~counter~0_9 v_~counter~0_8)) (.cse3 (= v_main_~t~0_19 v_main_~t~0_18))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~s~0_19 v_main_~s~0_20) (or (not .cse4) (not .cse5) (not .cse6) (not (= (* v_main_~s~0_20 4) (+ (* v_main_~t~0_19 v_main_~t~0_19) (* v_main_~t~0_19 2) 1))))) (let ((.cse9 (div (+ (* (- 1) v_main_~t~0_18) v_main_~t~0_19 2) (- 4)))) (let ((.cse8 (* .cse9 2))) (and (= (+ (* v_main_~a~0_19 v_main_~a~0_19) .cse7 1) v_main_~s~0_20) .cse4 (= (mod (+ v_main_~t~0_19 (* v_main_~t~0_18 3) 2) 4) 0) .cse6 (= (+ .cse8 1 v_main_~a~0_19) v_main_~a~0_18) (<= 0 .cse9) .cse5 (= v_main_~s~0_19 (+ v_main_~s~0_20 v_main_~t~0_19 (* (* v_main_~t~0_19 .cse9) 2) 2 (* (* .cse9 .cse9) 4) (* .cse9 6))) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (* (- 1) v_main_~t~0_18) v_main_~t~0_19 2) (- 4)))) (not (<= 1 v_itHalf_1)) (let ((.cse10 (* (* v_main_~t~0_19 v_itHalf_1) 2)) (.cse11 (* v_itHalf_1 2))) (and (= (+ v_main_~s~0_20 .cse10) (+ (* (* v_itHalf_1 v_main_~a~0_19) 4) (* v_main_~a~0_19 v_main_~a~0_19) (* 2 v_main_~a~0_19) .cse11 1)) (<= (+ v_main_~s~0_20 .cse10 .cse11 (* (* v_itHalf_1 v_itHalf_1) 4)) v_main_~n~0_6) (< (+ v_~counter~0_9 .cse11) 50))))) (= v_~counter~0_8 (+ .cse8 v_~counter~0_9 1))))) (let ((.cse13 (div (+ v_~counter~0_9 (* (- 1) v_~counter~0_8)) (- 2)))) (let ((.cse12 (* 2 .cse13))) (and (= (+ .cse12 v_main_~a~0_19) v_main_~a~0_18) (= v_main_~s~0_19 (+ v_main_~s~0_20 (* (* .cse13 .cse13) 4) (* 2 (* v_main_~t~0_19 .cse13)) .cse12)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ v_~counter~0_9 (* (- 1) v_~counter~0_8)) (- 2)))) (not (<= 0 v_itHalf_1)) (let ((.cse15 (* (* v_main_~t~0_19 v_itHalf_1) 2)) (.cse14 (* v_itHalf_1 2))) (and (< (+ v_~counter~0_9 .cse14) 49) (<= (+ v_main_~s~0_20 v_main_~t~0_19 2 (* v_itHalf_1 6) .cse15 (* (* v_itHalf_1 v_itHalf_1) 4)) v_main_~n~0_6) (= (+ v_main_~s~0_20 v_main_~t~0_19 .cse15) (+ (* 4 v_main_~a~0_19) (* (* v_itHalf_1 v_main_~a~0_19) 4) 2 (* v_main_~a~0_19 v_main_~a~0_19) .cse14)))))) .cse4 (= v_main_~t~0_18 (+ v_main_~t~0_19 (* .cse13 4))) (= (mod (+ v_~counter~0_9 v_~counter~0_8) 2) 0) .cse5 (< 0 .cse13)))) (and (= v_main_~n~0_6 v_main_~n~0_6) .cse0 (= v_main_~s~0_20 v_main_~s~0_19) .cse1 .cse2 .cse3)))) InVars {~counter~0=v_~counter~0_9, main_~t~0=v_main_~t~0_19, main_#t~post5=|v_main_#t~post5_8|, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_20, main_~a~0=v_main_~a~0_19} OutVars{~counter~0=v_~counter~0_8, main_~t~0=v_main_~t~0_18, main_#t~post5=|v_main_#t~post5_6|, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_19, main_~a~0=v_main_~a~0_18} AuxVars[] AssignedVars[~counter~0, main_~t~0, main_#t~post5, main_~s~0, main_~a~0] {1236#(or (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0) (< (* v_itHalf_1 2) 50)))))) (= ~counter~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1))) (and (= main_~a~0 0) (= main_~t~0 1) (= ~counter~0 0)) (and (= main_~a~0 (* (div (* ~counter~0 (- 1)) (- 2)) 2)) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ (* (* (div (* ~counter~0 (- 1)) (- 2)) (div (* ~counter~0 (- 1)) (- 2))) 4) main_~n~0 (* (div (* ~counter~0 (- 1)) (- 2)) 4))) (forall ((v_itHalf_1 Int)) (or (and (< (* v_itHalf_1 2) 49) (= (+ 2 (* v_itHalf_1 2)) (+ (* (div (* ~counter~0 (- 1)) (- 2)) (- 4)) main_~s~0 (* (div (* ~counter~0 (- 1)) (- 2)) (div (* ~counter~0 (- 1)) (- 2)) (- 4)) (* v_itHalf_1 2) 1)) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ (* (* (div (* ~counter~0 (- 1)) (- 2)) (div (* ~counter~0 (- 1)) (- 2))) 4) main_~n~0 (* (div (* ~counter~0 (- 1)) (- 2)) 4)))) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (* ~counter~0 (- 1)) (- 2)))))))) (< 0 (div (* ~counter~0 (- 1)) (- 2))) (= (mod ~counter~0 2) 0) (= (+ (* (div (* ~counter~0 (- 1)) (- 2)) 4) 1) main_~t~0)))} is VALID [2022-04-15 11:04:27,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {1236#(or (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0) (< (* v_itHalf_1 2) 50)))))) (= ~counter~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1))) (and (= main_~a~0 0) (= main_~t~0 1) (= ~counter~0 0)) (and (= main_~a~0 (* (div (* ~counter~0 (- 1)) (- 2)) 2)) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ (* (* (div (* ~counter~0 (- 1)) (- 2)) (div (* ~counter~0 (- 1)) (- 2))) 4) main_~n~0 (* (div (* ~counter~0 (- 1)) (- 2)) 4))) (forall ((v_itHalf_1 Int)) (or (and (< (* v_itHalf_1 2) 49) (= (+ 2 (* v_itHalf_1 2)) (+ (* (div (* ~counter~0 (- 1)) (- 2)) (- 4)) main_~s~0 (* (div (* ~counter~0 (- 1)) (- 2)) (div (* ~counter~0 (- 1)) (- 2)) (- 4)) (* v_itHalf_1 2) 1)) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ (* (* (div (* ~counter~0 (- 1)) (- 2)) (div (* ~counter~0 (- 1)) (- 2))) 4) main_~n~0 (* (div (* ~counter~0 (- 1)) (- 2)) 4)))) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (* ~counter~0 (- 1)) (- 2)))))))) (< 0 (div (* ~counter~0 (- 1)) (- 2))) (= (mod ~counter~0 2) 0) (= (+ (* (div (* ~counter~0 (- 1)) (- 2)) 4) 1) main_~t~0)))} [69] L30-1_primed-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1240#(or (and (= (mod (+ (* main_~t~0 3) 1) 4) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (not (<= 0 v_itHalf_1)) (and (< (* v_itHalf_1 2) 49) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (= main_~s~0 (+ (* (* (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2)) (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 4) (* 4 (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 1))))))) (<= |main_#t~post5| (* 2 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (= (* 2 (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) main_~a~0) (< 0 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0) (< (* v_itHalf_1 2) 50)))))) (<= |main_#t~post5| (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1))) (and (= main_~a~0 0) (<= |main_#t~post5| 0) (= main_~t~0 1)))} is VALID [2022-04-15 11:04:27,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {1240#(or (and (= (mod (+ (* main_~t~0 3) 1) 4) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (not (<= 0 v_itHalf_1)) (and (< (* v_itHalf_1 2) 49) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (= main_~s~0 (+ (* (* (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2)) (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 4) (* 4 (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 1))))))) (<= |main_#t~post5| (* 2 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (= (* 2 (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) main_~a~0) (< 0 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0) (< (* v_itHalf_1 2) 50)))))) (<= |main_#t~post5| (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1))) (and (= main_~a~0 0) (<= |main_#t~post5| 0) (= main_~t~0 1)))} assume !(#t~post5 < 50);havoc #t~post5; {1244#(and (= (mod (+ (* main_~t~0 3) 1) 4) 0) (= main_~a~0 (* 2 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (not (<= 0 v_itHalf_1)) (and (< (* v_itHalf_1 2) 49) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (= main_~s~0 (+ (* (* (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2)) (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 4) (* 4 (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 1))))))) (<= 50 (* 2 (div (+ (* (- 1) main_~t~0) 1) (- 4)))))} is VALID [2022-04-15 11:04:29,126 WARN L272 TraceCheckUtils]: 9: Hoare triple {1244#(and (= (mod (+ (* main_~t~0 3) 1) 4) 0) (= main_~a~0 (* 2 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (not (<= 0 v_itHalf_1)) (and (< (* v_itHalf_1 2) 49) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (= main_~s~0 (+ (* (* (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2)) (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 4) (* 4 (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 1))))))) (<= 50 (* 2 (div (+ (* (- 1) main_~t~0) 1) (- 4)))))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1248#(exists ((aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 Int) (aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 Int) (main_~n~0 Int) (aux_div_v_main_~t~0_BEFORE_CALL_6_53 Int) (main_~s~0 Int)) (and (<= (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 4) (+ (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 4) (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4))) (<= main_~s~0 (+ (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 4) main_~n~0 (* (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 aux_div_v_main_~t~0_BEFORE_CALL_6_53) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (< (* v_itHalf_1 2) 49) (<= (+ (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) main_~s~0 3 (* (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55) 8) (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55) 4) (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 4) (* (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99) 4))) (= (+ (* (* (div (+ (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 (- 4))) (- 4)) (div (+ (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 (- 4))) (- 4))) 4) (* (div (+ (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 (- 4))) (- 4)) 4) 1) main_~s~0)) (not (<= (+ v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 1) aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99)))) (<= 1 |__VERIFIER_assert_#in~cond|) (<= 50 (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 2)) (<= 0 (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4)) (< (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) 4) (< (+ (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 4) (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4)) (+ (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 4) 4))))} is UNKNOWN [2022-04-15 11:04:31,132 WARN L290 TraceCheckUtils]: 10: Hoare triple {1248#(exists ((aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 Int) (aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 Int) (main_~n~0 Int) (aux_div_v_main_~t~0_BEFORE_CALL_6_53 Int) (main_~s~0 Int)) (and (<= (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 4) (+ (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 4) (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4))) (<= main_~s~0 (+ (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 4) main_~n~0 (* (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 aux_div_v_main_~t~0_BEFORE_CALL_6_53) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (< (* v_itHalf_1 2) 49) (<= (+ (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) main_~s~0 3 (* (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55) 8) (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55) 4) (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 4) (* (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99) 4))) (= (+ (* (* (div (+ (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 (- 4))) (- 4)) (div (+ (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 (- 4))) (- 4))) 4) (* (div (+ (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 (- 4))) (- 4)) 4) 1) main_~s~0)) (not (<= (+ v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 1) aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99)))) (<= 1 |__VERIFIER_assert_#in~cond|) (<= 50 (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 2)) (<= 0 (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4)) (< (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) 4) (< (+ (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 4) (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4)) (+ (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 4) 4))))} ~cond := #in~cond; {1252#(and (exists ((aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 Int) (aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 Int) (main_~n~0 Int) (aux_div_v_main_~t~0_BEFORE_CALL_6_53 Int) (main_~s~0 Int)) (and (<= (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 4) (+ (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 4) (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4))) (<= main_~s~0 (+ (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 4) main_~n~0 (* (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 aux_div_v_main_~t~0_BEFORE_CALL_6_53) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (< (* v_itHalf_1 2) 49) (<= (+ (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) main_~s~0 3 (* (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55) 8) (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55) 4) (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 4) (* (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99) 4))) (= (+ (* (* (div (+ (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 (- 4))) (- 4)) (div (+ (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 (- 4))) (- 4))) 4) (* (div (+ (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 (- 4))) (- 4)) 4) 1) main_~s~0)) (not (<= (+ v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 1) aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99)))) (<= 50 (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 2)) (<= 0 (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4)) (< (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) 4) (< (+ (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 4) (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4)) (+ (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 4) 4)))) (<= 1 __VERIFIER_assert_~cond))} is UNKNOWN [2022-04-15 11:04:31,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {1252#(and (exists ((aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 Int) (aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 Int) (main_~n~0 Int) (aux_div_v_main_~t~0_BEFORE_CALL_6_53 Int) (main_~s~0 Int)) (and (<= (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 4) (+ (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 4) (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4))) (<= main_~s~0 (+ (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 4) main_~n~0 (* (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 aux_div_v_main_~t~0_BEFORE_CALL_6_53) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (< (* v_itHalf_1 2) 49) (<= (+ (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) main_~s~0 3 (* (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55) 8) (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55) 4) (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 4) (* (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99) 4))) (= (+ (* (* (div (+ (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 (- 4))) (- 4)) (div (+ (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 (- 4))) (- 4))) 4) (* (div (+ (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 (- 4))) (- 4)) 4) 1) main_~s~0)) (not (<= (+ v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 1) aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99)))) (<= 50 (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 2)) (<= 0 (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4)) (< (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4) 4) (< (+ (* aux_div_v_main_~t~0_BEFORE_CALL_6_53 4) (* aux_div_aux_mod_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99_55 4)) (+ (* aux_div_aux_mod_v_main_~t~0_BEFORE_CALL_6_53_99 4) 4)))) (<= 1 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1212#false} is VALID [2022-04-15 11:04:31,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-15 11:04:31,133 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 11:04:31,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 11:04:31,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:04:31,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355997076] [2022-04-15 11:04:31,134 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:04:31,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436626145] [2022-04-15 11:04:31,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436626145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:04:31,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:04:31,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 11:05:05,845 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:05:05,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1879697051] [2022-04-15 11:05:05,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1879697051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:05:05,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:05:05,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 11:05:05,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526574830] [2022-04-15 11:05:05,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:05:05,846 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 12 states have internal predecessors, (17), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 30 [2022-04-15 11:05:05,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:05:05,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 12 states have internal predecessors, (17), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 11:05:14,981 WARN L143 InductivityCheck]: Transition 1267#(and (<= main_~s~0 (+ main_~n~0 main_~t~0)) (= (+ (* main_~t~0 6) (- 3) (* main_~s~0 (- 4)) (* (+ (- 2) main_~t~0) (+ (- 2) main_~t~0))) 0) (< ~counter~0 51) (exists ((v_main_~t~0_BEFORE_CALL_7 Int) (v_main_~a~0_BEFORE_CALL_6 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_4 Int)) (and (or (and (= v_main_~t~0_BEFORE_CALL_7 (+ (* 2 v_main_~a~0_BEFORE_CALL_6) 1)) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 1)) (and (not (= v_main_~t~0_BEFORE_CALL_7 (+ (* 2 v_main_~a~0_BEFORE_CALL_6) 1))) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 0))) (or (and (= v_main_~a~0_BEFORE_CALL_6 0) (= ~counter~0 1) (= v_main_~t~0_BEFORE_CALL_7 1)) (and (exists ((v_main_~n~0_BEFORE_CALL_1 Int) (v_main_~s~0_BEFORE_CALL_8 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (< (* v_itHalf_1 2) 49) (= v_main_~s~0_BEFORE_CALL_8 (+ (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 4) (* (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) (div (+ (* ~counter~0 (- 1)) 1) (- 2))) 4) 1)) (<= (+ v_main_~s~0_BEFORE_CALL_8 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 4) (* (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) (div (+ (* ~counter~0 (- 1)) 1) (- 2))) 4) v_main_~n~0_BEFORE_CALL_1))) (not (<= (+ v_itHalf_1 1) (div (+ (* ~counter~0 (- 1)) 1) (- 2))))))) (= (mod (+ ~counter~0 1) 2) 0) (= (+ (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 4) 1) v_main_~t~0_BEFORE_CALL_7) (= (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 2) v_main_~a~0_BEFORE_CALL_6) (< 0 (div (+ (* ~counter~0 (- 1)) 1) (- 2)))) (and (= (mod (+ (* 3 v_main_~t~0_BEFORE_CALL_7) 3) 4) 0) (exists ((v_main_~n~0_BEFORE_CALL_1 Int)) (and (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (* (- 1) v_main_~t~0_BEFORE_CALL_7) 3) (- 4)))) (and (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) v_main_~n~0_BEFORE_CALL_1) (< (* v_itHalf_1 2) 50)) (not (<= 1 v_itHalf_1)))) (<= 1 v_main_~n~0_BEFORE_CALL_1))) (= (+ (* 2 (div (+ (* (- 1) v_main_~t~0_BEFORE_CALL_7) 3) (- 4))) 1) v_main_~a~0_BEFORE_CALL_6) (= ~counter~0 (+ (* 2 (div (+ (* (- 1) v_main_~t~0_BEFORE_CALL_7) 3) (- 4))) 2)) (<= 0 (div (+ (* (- 1) v_main_~t~0_BEFORE_CALL_7) 3) (- 4))))) (or (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 1) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 0))))) ( _ , #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; , 1240#(or (and (= (mod (+ (* main_~t~0 3) 1) 4) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (not (<= 0 v_itHalf_1)) (and (< (* v_itHalf_1 2) 49) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (= main_~s~0 (+ (* (* (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2)) (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 4) (* 4 (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 1))))))) (<= |main_#t~post5| (* 2 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (= (* 2 (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) main_~a~0) (< 0 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0) (< (* v_itHalf_1 2) 50)))))) (<= |main_#t~post5| (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1))) (and (= main_~a~0 0) (<= |main_#t~post5| 0) (= main_~t~0 1))) ) not inductive [2022-04-15 11:05:14,998 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 11:05:15,182 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 11:05:15,183 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 11:05:15,186 INFO L158 Benchmark]: Toolchain (without parser) took 105842.50ms. Allocated memory was 198.2MB in the beginning and 295.7MB in the end (delta: 97.5MB). Free memory was 145.2MB in the beginning and 161.5MB in the end (delta: -16.4MB). Peak memory consumption was 82.8MB. Max. memory is 8.0GB. [2022-04-15 11:05:15,186 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 11:05:15,186 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.49ms. Allocated memory is still 198.2MB. Free memory was 145.0MB in the beginning and 174.7MB in the end (delta: -29.7MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-04-15 11:05:15,187 INFO L158 Benchmark]: Boogie Preprocessor took 31.31ms. Allocated memory is still 198.2MB. Free memory was 174.7MB in the beginning and 173.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 11:05:15,187 INFO L158 Benchmark]: RCFGBuilder took 228.72ms. Allocated memory is still 198.2MB. Free memory was 173.2MB in the beginning and 162.5MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 11:05:15,187 INFO L158 Benchmark]: TraceAbstraction took 105370.85ms. Allocated memory was 198.2MB in the beginning and 295.7MB in the end (delta: 97.5MB). Free memory was 162.1MB in the beginning and 161.5MB in the end (delta: 598.6kB). Peak memory consumption was 99.2MB. Max. memory is 8.0GB. [2022-04-15 11:05:15,188 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.49ms. Allocated memory is still 198.2MB. Free memory was 145.0MB in the beginning and 174.7MB in the end (delta: -29.7MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.31ms. Allocated memory is still 198.2MB. Free memory was 174.7MB in the beginning and 173.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 228.72ms. Allocated memory is still 198.2MB. Free memory was 173.2MB in the beginning and 162.5MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 105370.85ms. Allocated memory was 198.2MB in the beginning and 295.7MB in the end (delta: 97.5MB). Free memory was 162.1MB in the beginning and 161.5MB in the end (delta: 598.6kB). Peak memory consumption was 99.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 11:05:15,399 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-04-15 11:05:15,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...