/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_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:58:57,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:58:57,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:58:57,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:58:57,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:58:57,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:58:57,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:58:57,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:58:57,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:58:57,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:58:57,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:58:57,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:58:57,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:58:57,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:58:57,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:58:57,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:58:57,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:58:57,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:58:57,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:58:57,667 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:58:57,674 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:58:57,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:58:57,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:58:57,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:58:57,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:58:57,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:58:57,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:58:57,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:58:57,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:58:57,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:58:57,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:58:57,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:58:57,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:58:57,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:58:57,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:58:57,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:58:57,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:58:57,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:58:57,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:58:57,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:58:57,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:58:57,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:58:57,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 07:58:57,709 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:58:57,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:58:57,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:58:57,710 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:58:57,710 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:58:57,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:58:57,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:58:57,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:58:57,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:58:57,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:58:57,711 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:58:57,711 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:58:57,712 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:58:57,712 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:58:57,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:58:57,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:58:57,712 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:58:57,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:58:57,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:58:57,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:58:57,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:58:57,713 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:58:57,713 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:58:57,713 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:58:57,713 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:58:57,714 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-28 07:58:57,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:58:57,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:58:57,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:58:57,938 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:58:57,939 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:58:57,940 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound10.c [2022-04-28 07:58:58,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/642a99130/6d018505f83d4117ab17e58adaf513d3/FLAG9fee4f40a [2022-04-28 07:58:58,419 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:58:58,419 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound10.c [2022-04-28 07:58:58,428 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/642a99130/6d018505f83d4117ab17e58adaf513d3/FLAG9fee4f40a [2022-04-28 07:58:58,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/642a99130/6d018505f83d4117ab17e58adaf513d3 [2022-04-28 07:58:58,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:58:58,452 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:58:58,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:58:58,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:58:58,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:58:58,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:58:58" (1/1) ... [2022-04-28 07:58:58,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d45c869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:58, skipping insertion in model container [2022-04-28 07:58:58,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:58:58" (1/1) ... [2022-04-28 07:58:58,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:58:58,487 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:58:58,671 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_unwindbound10.c[520,533] [2022-04-28 07:58:58,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:58:58,724 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:58:58,740 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_unwindbound10.c[520,533] [2022-04-28 07:58:58,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:58:58,770 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:58:58,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:58 WrapperNode [2022-04-28 07:58:58,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:58:58,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:58:58,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:58:58,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:58:58,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:58" (1/1) ... [2022-04-28 07:58:58,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:58" (1/1) ... [2022-04-28 07:58:58,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:58" (1/1) ... [2022-04-28 07:58:58,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:58" (1/1) ... [2022-04-28 07:58:58,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:58" (1/1) ... [2022-04-28 07:58:58,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:58" (1/1) ... [2022-04-28 07:58:58,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:58" (1/1) ... [2022-04-28 07:58:58,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:58:58,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:58:58,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:58:58,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:58:58,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:58" (1/1) ... [2022-04-28 07:58:58,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:58:58,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:58,848 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-28 07:58:58,877 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-28 07:58:58,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:58:58,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:58:58,903 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:58:58,903 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:58:58,904 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:58:58,904 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:58:58,904 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:58:58,904 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:58:58,904 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:58:58,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:58:58,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 07:58:58,905 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:58:58,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:58:58,906 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:58:58,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:58:58,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:58:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:58:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:58:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:58:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:58:58,968 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:58:58,970 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:58:59,152 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:58:59,157 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:58:59,157 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:58:59,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:58:59 BoogieIcfgContainer [2022-04-28 07:58:59,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:58:59,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:58:59,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:58:59,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:58:59,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:58:58" (1/3) ... [2022-04-28 07:58:59,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49536c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:58:59, skipping insertion in model container [2022-04-28 07:58:59,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:58" (2/3) ... [2022-04-28 07:58:59,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49536c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:58:59, skipping insertion in model container [2022-04-28 07:58:59,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:58:59" (3/3) ... [2022-04-28 07:58:59,182 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound10.c [2022-04-28 07:58:59,195 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:58:59,195 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:58:59,250 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:58:59,257 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4e45cd62, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@69649fb1 [2022-04-28 07:58:59,258 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:58:59,269 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-28 07:58:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 07:58:59,275 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:59,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:59,276 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:59,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:59,283 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 1 times [2022-04-28 07:58:59,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:59,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [888314719] [2022-04-28 07:58:59,305 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:59,305 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 2 times [2022-04-28 07:58:59,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:59,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13886273] [2022-04-28 07:58:59,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:59,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:59,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:58:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:59,525 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-28 07:58:59,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 07:58:59,526 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-28 07:58:59,527 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-28 07:58:59,528 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-28 07:58:59,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 07:58:59,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-28 07:58:59,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(); {29#true} is VALID [2022-04-28 07:58:59,529 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-28 07:58:59,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-28 07:58:59,530 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-28 07:58:59,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-28 07:58:59,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-28 07:58:59,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-28 07:58:59,531 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-28 07:58:59,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:59,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13886273] [2022-04-28 07:58:59,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13886273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:59,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:59,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:58:59,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:59,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [888314719] [2022-04-28 07:58:59,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [888314719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:59,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:59,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:58:59,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727754541] [2022-04-28 07:58:59,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:59,542 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-28 07:58:59,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:59,546 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-28 07:58:59,564 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-28 07:58:59,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:58:59,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:59,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:58:59,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:58:59,590 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-28 07:58:59,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:59,778 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-28 07:58:59,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:58:59,778 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-28 07:58:59,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:59,780 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-28 07:58:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-28 07:58:59,789 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-28 07:58:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-28 07:58:59,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-28 07:58:59,884 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-28 07:58:59,939 INFO L225 Difference]: With dead ends: 47 [2022-04-28 07:58:59,939 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 07:58:59,942 INFO L412 NwaCegarLoop]: 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-28 07:58:59,946 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:59,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:59,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 07:58:59,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-28 07:58:59,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:59,990 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-28 07:58:59,991 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-28 07:58:59,992 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-28 07:59:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:00,003 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-28 07:59:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 07:59:00,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:00,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:00,005 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-28 07:59:00,005 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-28 07:59:00,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:00,014 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-28 07:59:00,014 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 07:59:00,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:00,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:00,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:00,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:00,015 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-28 07:59:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-28 07:59:00,018 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-28 07:59:00,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:00,019 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-28 07:59:00,019 INFO L496 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-28 07:59:00,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 27 transitions. [2022-04-28 07:59:00,062 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-28 07:59:00,062 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-28 07:59:00,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 07:59:00,064 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:00,064 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:00,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:59:00,065 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:00,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:00,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 1 times [2022-04-28 07:59:00,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:00,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1903566342] [2022-04-28 07:59:00,066 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:59:00,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 2 times [2022-04-28 07:59:00,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:00,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506813731] [2022-04-28 07:59:00,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:00,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:00,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:59:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:00,173 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-28 07:59:00,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-28 07:59:00,174 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-28 07:59:00,175 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-28 07:59:00,175 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-28 07:59:00,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-28 07:59:00,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-28 07:59:00,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {222#(= ~counter~0 0)} call #t~ret6 := main(); {222#(= ~counter~0 0)} is VALID [2022-04-28 07:59:00,177 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-28 07:59:00,178 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-28 07:59:00,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {218#false} is VALID [2022-04-28 07:59:00,179 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-28 07:59:00,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#false} ~cond := #in~cond; {218#false} is VALID [2022-04-28 07:59:00,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#false} assume 0 == ~cond; {218#false} is VALID [2022-04-28 07:59:00,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-04-28 07:59:00,180 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-28 07:59:00,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:00,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506813731] [2022-04-28 07:59:00,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506813731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:00,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:00,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:59:00,181 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:00,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1903566342] [2022-04-28 07:59:00,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1903566342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:00,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:00,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:59:00,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048809263] [2022-04-28 07:59:00,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:00,182 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-28 07:59:00,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:00,183 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-28 07:59:00,193 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-28 07:59:00,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:59:00,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:00,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:59:00,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:59:00,194 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-28 07:59:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:00,365 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-28 07:59:00,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 07:59:00,365 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-28 07:59:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:00,366 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-28 07:59:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 07:59:00,370 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-28 07:59:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 07:59:00,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-28 07:59:00,414 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-28 07:59:00,416 INFO L225 Difference]: With dead ends: 32 [2022-04-28 07:59:00,416 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 07:59:00,417 INFO L412 NwaCegarLoop]: 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-28 07:59:00,420 INFO L413 NwaCegarLoop]: 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-28 07:59:00,421 INFO L414 NwaCegarLoop]: 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-28 07:59:00,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 07:59:00,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 07:59:00,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:00,433 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-28 07:59:00,433 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-28 07:59:00,434 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-28 07:59:00,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:00,438 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 07:59:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 07:59:00,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:00,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:00,441 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-28 07:59:00,442 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-28 07:59:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:00,445 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 07:59:00,445 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 07:59:00,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:00,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:00,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:00,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:00,448 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-28 07:59:00,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-28 07:59:00,451 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-28 07:59:00,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:00,452 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-28 07:59:00,452 INFO L496 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-28 07:59:00,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 29 transitions. [2022-04-28 07:59:00,488 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-28 07:59:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 07:59:00,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 07:59:00,489 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:00,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:00,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 07:59:00,489 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:00,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:00,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 1 times [2022-04-28 07:59:00,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:00,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1429928944] [2022-04-28 07:59:00,496 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:59:00,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 2 times [2022-04-28 07:59:00,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:00,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121975660] [2022-04-28 07:59:00,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:00,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:00,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:59:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:00,620 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-28 07:59:00,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 07:59:00,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-28 07:59:00,621 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-28 07:59:00,622 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-28 07:59:00,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 07:59:00,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-28 07:59:00,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-28 07:59:00,627 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-28 07:59:00,627 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-28 07:59:00,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !!(#t~post5 < 10);havoc #t~post5; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 07:59:00,632 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-28 07:59:00,633 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-28 07:59:00,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {386#false} is VALID [2022-04-28 07:59:00,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 07:59:00,635 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-28 07:59:00,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:00,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121975660] [2022-04-28 07:59:00,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121975660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:00,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:00,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 07:59:00,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:00,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1429928944] [2022-04-28 07:59:00,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1429928944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:00,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:00,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 07:59:00,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415588215] [2022-04-28 07:59:00,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:00,638 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-28 07:59:00,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:00,638 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-28 07:59:00,650 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-28 07:59:00,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 07:59:00,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:00,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 07:59:00,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 07:59:00,652 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-28 07:59:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:01,043 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-28 07:59:01,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:59:01,044 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-28 07:59:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:01,044 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-28 07:59:01,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 07:59:01,046 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-28 07:59:01,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 07:59:01,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 07:59:01,114 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-28 07:59:01,117 INFO L225 Difference]: With dead ends: 36 [2022-04-28 07:59:01,117 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 07:59:01,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:59:01,119 INFO L413 NwaCegarLoop]: 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-28 07:59:01,119 INFO L414 NwaCegarLoop]: 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-28 07:59:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 07:59:01,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-28 07:59:01,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:01,138 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-28 07:59:01,140 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-28 07:59:01,140 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-28 07:59:01,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:01,147 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 07:59:01,147 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 07:59:01,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:01,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:01,150 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-28 07:59:01,150 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-28 07:59:01,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:01,155 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 07:59:01,155 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 07:59:01,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:01,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:01,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:01,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:01,160 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-28 07:59:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 07:59:01,165 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-28 07:59:01,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:01,165 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 07:59:01,165 INFO L496 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-28 07:59:01,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-28 07:59:01,214 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-28 07:59:01,214 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 07:59:01,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 07:59:01,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:01,215 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:01,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 07:59:01,215 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:01,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:01,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 1 times [2022-04-28 07:59:01,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:01,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1344803812] [2022-04-28 07:59:01,216 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:59:01,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 2 times [2022-04-28 07:59:01,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:01,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408431693] [2022-04-28 07:59:01,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:01,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:01,245 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:01,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1490228282] [2022-04-28 07:59:01,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:59:01,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:01,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:01,252 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-28 07:59:01,275 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-28 07:59:01,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:59:01,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:01,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:59:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:01,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:01,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2022-04-28 07:59:01,487 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-28 07:59:01,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-28 07:59:01,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #66#return; {608#true} is VALID [2022-04-28 07:59:01,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret6 := main(); {608#true} is VALID [2022-04-28 07:59:01,497 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-28 07:59:01,500 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-28 07:59:01,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 07:59:01,502 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-28 07:59:01,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {608#true} ~cond := #in~cond; {608#true} is VALID [2022-04-28 07:59:01,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {608#true} assume !(0 == ~cond); {608#true} is VALID [2022-04-28 07:59:01,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-28 07:59:01,506 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-28 07:59:01,507 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-28 07:59:01,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {657#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:01,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {657#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {609#false} is VALID [2022-04-28 07:59:01,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-04-28 07:59:01,508 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-28 07:59:01,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:59:01,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:01,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408431693] [2022-04-28 07:59:01,509 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:01,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490228282] [2022-04-28 07:59:01,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490228282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:01,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:01,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:59:01,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:01,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1344803812] [2022-04-28 07:59:01,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1344803812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:01,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:01,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:59:01,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106024878] [2022-04-28 07:59:01,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:01,511 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-28 07:59:01,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:01,512 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-28 07:59:01,526 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-28 07:59:01,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:59:01,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:01,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:59:01,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:59:01,527 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-28 07:59:01,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:01,707 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-28 07:59:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:59:01,707 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-28 07:59:01,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:01,708 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-28 07:59:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 07:59:01,710 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-28 07:59:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 07:59:01,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-28 07:59:01,756 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-28 07:59:01,759 INFO L225 Difference]: With dead ends: 40 [2022-04-28 07:59:01,759 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 07:59:01,759 INFO L412 NwaCegarLoop]: 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-28 07:59:01,761 INFO L413 NwaCegarLoop]: 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-28 07:59:01,762 INFO L414 NwaCegarLoop]: 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-28 07:59:01,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 07:59:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-28 07:59:01,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:01,785 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-28 07:59:01,785 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-28 07:59:01,785 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-28 07:59:01,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:01,790 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 07:59:01,790 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 07:59:01,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:01,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:01,792 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-28 07:59:01,792 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-28 07:59:01,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:01,797 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 07:59:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 07:59:01,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:01,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:01,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:01,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:01,799 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-28 07:59:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-28 07:59:01,801 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 17 [2022-04-28 07:59:01,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:01,801 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-28 07:59:01,801 INFO L496 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-28 07:59:01,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 47 transitions. [2022-04-28 07:59:01,848 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-28 07:59:01,849 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-28 07:59:01,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 07:59:01,849 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:01,849 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:01,877 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-28 07:59:02,074 WARN L477 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-28 07:59:02,074 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:02,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:02,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 1 times [2022-04-28 07:59:02,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:02,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1143960064] [2022-04-28 07:59:02,076 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:59:02,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 2 times [2022-04-28 07:59:02,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:02,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778168101] [2022-04-28 07:59:02,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:02,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:02,089 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:02,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [608826664] [2022-04-28 07:59:02,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:59:02,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:02,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:02,095 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-28 07:59:02,099 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-28 07:59:02,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:59:02,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:02,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:59:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:02,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:02,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {895#true} call ULTIMATE.init(); {895#true} is VALID [2022-04-28 07:59:02,288 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-28 07:59:02,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-28 07:59:02,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {895#true} {895#true} #66#return; {895#true} is VALID [2022-04-28 07:59:02,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {895#true} call #t~ret6 := main(); {895#true} is VALID [2022-04-28 07:59:02,289 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-28 07:59:02,290 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-28 07:59:02,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 07:59:02,291 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-28 07:59:02,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-28 07:59:02,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-28 07:59:02,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-28 07:59:02,292 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-28 07:59:02,292 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-28 07:59:02,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-28 07:59:02,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-28 07:59:02,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-28 07:59:02,294 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-28 07:59:02,294 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-28 07:59:02,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {955#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {959#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:02,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {959#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {896#false} is VALID [2022-04-28 07:59:02,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {896#false} assume !false; {896#false} is VALID [2022-04-28 07:59:02,296 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-28 07:59:02,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:59:02,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:02,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778168101] [2022-04-28 07:59:02,297 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:02,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608826664] [2022-04-28 07:59:02,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608826664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:02,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:02,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:59:02,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:02,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1143960064] [2022-04-28 07:59:02,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1143960064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:02,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:02,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:59:02,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332307555] [2022-04-28 07:59:02,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:02,299 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-28 07:59:02,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:02,299 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-28 07:59:02,315 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-28 07:59:02,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:59:02,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:02,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:59:02,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:59:02,317 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-28 07:59:02,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:02,469 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-28 07:59:02,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:59:02,470 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-28 07:59:02,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:02,470 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-28 07:59:02,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 07:59:02,471 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-28 07:59:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 07:59:02,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-28 07:59:02,514 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-28 07:59:02,515 INFO L225 Difference]: With dead ends: 44 [2022-04-28 07:59:02,515 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 07:59:02,516 INFO L412 NwaCegarLoop]: 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-28 07:59:02,516 INFO L413 NwaCegarLoop]: 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-28 07:59:02,517 INFO L414 NwaCegarLoop]: 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-28 07:59:02,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 07:59:02,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 07:59:02,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:02,530 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-28 07:59:02,530 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-28 07:59:02,531 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-28 07:59:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:02,532 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-28 07:59:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 07:59:02,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:02,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:02,533 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-28 07:59:02,533 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-28 07:59:02,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:02,535 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-28 07:59:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 07:59:02,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:02,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:02,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:02,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:02,536 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-28 07:59:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-28 07:59:02,537 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-04-28 07:59:02,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:02,538 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-28 07:59:02,538 INFO L496 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-28 07:59:02,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 45 transitions. [2022-04-28 07:59:02,582 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-28 07:59:02,582 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 07:59:02,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 07:59:02,583 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:02,583 INFO L195 NwaCegarLoop]: 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-28 07:59:02,610 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-28 07:59:02,798 WARN L477 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-28 07:59:02,799 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:02,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:02,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 1 times [2022-04-28 07:59:02,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:02,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1570801390] [2022-04-28 07:59:07,513 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-28 07:59:07,522 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 07:59:07,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1831963292, now seen corresponding path program 1 times [2022-04-28 07:59:07,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:07,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060392167] [2022-04-28 07:59:07,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:07,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:07,557 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:07,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2086453129] [2022-04-28 07:59:07,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:07,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:07,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:07,561 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-28 07:59:07,565 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-28 07:59:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:07,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 07:59:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:07,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:51,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-28 07:59:51,328 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-28 07:59:51,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {1219#(= ~counter~0 0)} assume true; {1219#(= ~counter~0 0)} is VALID [2022-04-28 07:59:51,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1219#(= ~counter~0 0)} {1211#true} #66#return; {1219#(= ~counter~0 0)} is VALID [2022-04-28 07:59:51,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {1219#(= ~counter~0 0)} call #t~ret6 := main(); {1219#(= ~counter~0 0)} is VALID [2022-04-28 07:59:51,329 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-28 07:59:51,381 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 ((.cse11 (* 2 v_main_~a~0_19))) (let ((.cse2 (<= v_main_~s~0_20 v_main_~n~0_6)) (.cse7 (< v_~counter~0_9 10)) (.cse3 (= v_main_~t~0_19 (+ .cse11 1))) (.cse6 (= |v_main_#t~post5_8| |v_main_#t~post5_6|)) (.cse8 (= v_main_~a~0_19 v_main_~a~0_18)) (.cse9 (= v_~counter~0_9 v_~counter~0_8)) (.cse10 (= v_main_~t~0_19 v_main_~t~0_18))) (or (let ((.cse1 (div (+ v_~counter~0_9 (* (- 1) v_~counter~0_8)) (- 2)))) (let ((.cse0 (* 2 .cse1))) (and (= (+ .cse0 v_main_~a~0_19) v_main_~a~0_18) (= v_main_~s~0_19 (+ v_main_~s~0_20 (* (* .cse1 .cse1) 4) (* 2 (* v_main_~t~0_19 .cse1)) .cse0)) .cse2 (= v_main_~t~0_18 (+ v_main_~t~0_19 (* .cse1 4))) (= (mod (+ v_~counter~0_9 v_~counter~0_8) 2) 0) .cse3 (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 ((.cse4 (* (* v_main_~t~0_19 v_itHalf_1) 2)) (.cse5 (* v_itHalf_1 2))) (and (<= (+ v_main_~s~0_20 v_main_~t~0_19 2 (* v_itHalf_1 6) .cse4 (* (* v_itHalf_1 v_itHalf_1) 4)) v_main_~n~0_6) (= (+ v_main_~s~0_20 v_main_~t~0_19 .cse4) (+ (* 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) .cse5)) (< (+ v_~counter~0_9 .cse5) 9))))) (< 0 .cse1)))) (and .cse6 (or (not .cse2) (not .cse3) (not .cse7) (not (= (* v_main_~s~0_20 4) (+ (* v_main_~t~0_19 v_main_~t~0_19) (* v_main_~t~0_19 2) 1)))) .cse8 .cse9 .cse10 (= v_main_~s~0_19 v_main_~s~0_20)) (let ((.cse13 (div (+ (* (- 1) v_main_~t~0_18) v_main_~t~0_19 2) (- 4)))) (let ((.cse12 (* .cse13 2))) (and (= (+ (* v_main_~a~0_19 v_main_~a~0_19) .cse11 1) v_main_~s~0_20) .cse2 .cse7 (= (mod (+ v_main_~t~0_19 (* v_main_~t~0_18 3) 2) 4) 0) (= (+ .cse12 1 v_main_~a~0_19) v_main_~a~0_18) (<= 0 .cse13) .cse3 (= v_main_~s~0_19 (+ v_main_~s~0_20 v_main_~t~0_19 (* (* v_main_~t~0_19 .cse13) 2) 2 (* (* .cse13 .cse13) 4) (* .cse13 6))) (= v_~counter~0_8 (+ .cse12 v_~counter~0_9 1)) (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 ((.cse14 (* (* v_main_~t~0_19 v_itHalf_1) 2)) (.cse15 (* v_itHalf_1 2))) (and (= (+ v_main_~s~0_20 .cse14) (+ (* (* 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) .cse15 1)) (<= (+ v_main_~s~0_20 .cse14 .cse15 (* (* v_itHalf_1 v_itHalf_1) 4)) v_main_~n~0_6) (< (+ v_~counter~0_9 .cse15) 10)))))))) (and (= v_main_~n~0_6 v_main_~n~0_6) .cse6 (= v_main_~s~0_20 v_main_~s~0_19) .cse8 .cse9 .cse10)))) 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 (= main_~a~0 (* (div (* ~counter~0 (- 1)) (- 2)) 2)) (< 0 (div (* ~counter~0 (- 1)) (- 2))) (= (mod ~counter~0 2) 0) (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 (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (* ~counter~0 (- 1)) (- 2)))) (and (= (+ 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))) (< (* v_itHalf_1 2) 9)))))) (= (+ (* (div (* ~counter~0 (- 1)) (- 2)) 4) 1) main_~t~0)) (and (= main_~a~0 0) (= main_~t~0 1) (= ~counter~0 0)) (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (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 2) 10) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0)))))) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (= ~counter~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1))))} is VALID [2022-04-28 07:59:51,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {1236#(or (and (= main_~a~0 (* (div (* ~counter~0 (- 1)) (- 2)) 2)) (< 0 (div (* ~counter~0 (- 1)) (- 2))) (= (mod ~counter~0 2) 0) (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 (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (* ~counter~0 (- 1)) (- 2)))) (and (= (+ 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))) (< (* v_itHalf_1 2) 9)))))) (= (+ (* (div (* ~counter~0 (- 1)) (- 2)) 4) 1) main_~t~0)) (and (= main_~a~0 0) (= main_~t~0 1) (= ~counter~0 0)) (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (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 2) 10) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0)))))) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (= ~counter~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1))))} [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) 3) 4) 0) (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 2) 10) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0)))))) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (<= |main_#t~post5| (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1))) (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)))) (and (<= (+ 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))) (< (* v_itHalf_1 2) 9) (= 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))) (not (<= 0 v_itHalf_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 (= main_~a~0 0) (<= |main_#t~post5| 0) (= main_~t~0 1)))} is VALID [2022-04-28 07:59:51,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {1240#(or (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (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 2) 10) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0)))))) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (<= |main_#t~post5| (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1))) (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)))) (and (<= (+ 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))) (< (* v_itHalf_1 2) 9) (= 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))) (not (<= 0 v_itHalf_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 (= main_~a~0 0) (<= |main_#t~post5| 0) (= main_~t~0 1)))} assume !(#t~post5 < 10);havoc #t~post5; {1244#(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)))) (and (<= (+ 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))) (< (* v_itHalf_1 2) 9) (= 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))) (not (<= 0 v_itHalf_1)))))) (= main_~a~0 (* 2 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (<= 10 (* 2 (div (+ (* (- 1) main_~t~0) 1) (- 4)))))} is VALID [2022-04-28 07:59:51,618 INFO L272 TraceCheckUtils]: 9: Hoare triple {1244#(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)))) (and (<= (+ 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))) (< (* v_itHalf_1 2) 9) (= 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))) (not (<= 0 v_itHalf_1)))))) (= main_~a~0 (* 2 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (<= 10 (* 2 (div (+ (* (- 1) main_~t~0) 1) (- 4)))))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1248#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:51,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {1248#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1252#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:51,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {1252#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1212#false} is VALID [2022-04-28 07:59:51,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-28 07:59:51,619 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-28 07:59:51,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:59:51,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:51,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060392167] [2022-04-28 07:59:51,620 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:51,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086453129] [2022-04-28 07:59:51,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086453129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:51,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:51,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 08:00:36,832 WARN L232 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 130 DAG size of output: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 08:01:07,029 WARN L232 SmtUtils]: Spent 6.61s on a formula simplification. DAG size of input: 132 DAG size of output: 128 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 08:01:12,933 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:01:12,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1570801390] [2022-04-28 08:01:12,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1570801390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:12,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:12,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 08:01:12,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144004157] [2022-04-28 08:01:12,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:01:12,934 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 14 states have internal predecessors, (20), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 30 [2022-04-28 08:01:12,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:01:12,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 14 states have internal predecessors, (20), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 08:01:14,574 WARN L143 InductivityCheck]: Transition 1262#(and (< ~counter~0 11) (exists ((v_main_~t~0_22 Int) (v_main_~a~0_22 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_4 Int)) (and (or (and (= (+ (* 2 (div (+ 3 (* (- 1) v_main_~t~0_22)) (- 4))) 1) v_main_~a~0_22) (= (+ ~counter~0 (- 1)) (+ (* 2 (div (+ 3 (* (- 1) v_main_~t~0_22)) (- 4))) 1)) (exists ((v_main_~n~0_BEFORE_RETURN_1 Int)) (and (<= 1 v_main_~n~0_BEFORE_RETURN_1) (forall ((v_itHalf_1 Int)) (or (and (< (* v_itHalf_1 2) 10) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) v_main_~n~0_BEFORE_RETURN_1)) (not (<= 1 v_itHalf_1)) (not (<= v_itHalf_1 (div (+ 3 (* (- 1) v_main_~t~0_22)) (- 4)))))))) (<= 0 (div (+ 3 (* (- 1) v_main_~t~0_22)) (- 4))) (= (mod (+ 3 (* v_main_~t~0_22 3)) 4) 0)) (and (exists ((v_main_~n~0_BEFORE_RETURN_1 Int) (v_main_~s~0_BEFORE_RETURN_1 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* ~counter~0 (- 1)) 1) (- 2)))) (and (= v_main_~s~0_BEFORE_RETURN_1 (+ (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 4) (* (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) (div (+ (* ~counter~0 (- 1)) 1) (- 2))) 4) 1)) (< (* v_itHalf_1 2) 9) (<= (+ 3 v_main_~s~0_BEFORE_RETURN_1 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 4) v_main_~n~0_BEFORE_RETURN_1 (* (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) (div (+ (* ~counter~0 (- 1)) 1) (- 2))) 4))))))) (= v_main_~t~0_22 (+ (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 4) 1)) (= (mod (+ ~counter~0 1) 2) 0) (= (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 2) v_main_~a~0_22) (< 0 (div (+ (* ~counter~0 (- 1)) 1) (- 2)))) (and (= 0 v_main_~a~0_22) (= (+ ~counter~0 (- 1)) 0) (= v_main_~t~0_22 1))) (or (and (= (+ (* 2 v_main_~a~0_22) 1) v_main_~t~0_22) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 1)) (and (not (= (+ (* 2 v_main_~a~0_22) 1) v_main_~t~0_22)) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 0))) (or (and (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 0)) (and (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 1) (= main_~t~0 (+ (* main_~a~0 2) 1))))))) ( _ , call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); , 1264#(and (< ~counter~0 11) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1)) (exists ((v_main_~t~0_22 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_4 Int) (v_main_~a~0_22 Int)) (and (or (and (= (+ (* 2 (div (+ 3 (* (- 1) v_main_~t~0_22)) (- 4))) 1) v_main_~a~0_22) (= (+ ~counter~0 (- 1)) (+ (* 2 (div (+ 3 (* (- 1) v_main_~t~0_22)) (- 4))) 1)) (exists ((v_main_~n~0_BEFORE_RETURN_1 Int)) (and (<= 1 v_main_~n~0_BEFORE_RETURN_1) (forall ((v_itHalf_1 Int)) (or (and (< (* v_itHalf_1 2) 10) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) v_main_~n~0_BEFORE_RETURN_1)) (not (<= 1 v_itHalf_1)) (not (<= v_itHalf_1 (div (+ 3 (* (- 1) v_main_~t~0_22)) (- 4)))))))) (<= 0 (div (+ 3 (* (- 1) v_main_~t~0_22)) (- 4))) (= (mod (+ 3 (* v_main_~t~0_22 3)) 4) 0)) (and (exists ((v_main_~n~0_BEFORE_RETURN_1 Int) (v_main_~s~0_BEFORE_RETURN_1 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* ~counter~0 (- 1)) 1) (- 2)))) (and (= v_main_~s~0_BEFORE_RETURN_1 (+ (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 4) (* (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) (div (+ (* ~counter~0 (- 1)) 1) (- 2))) 4) 1)) (< (* v_itHalf_1 2) 9) (<= (+ 3 v_main_~s~0_BEFORE_RETURN_1 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 4) v_main_~n~0_BEFORE_RETURN_1 (* (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) (div (+ (* ~counter~0 (- 1)) 1) (- 2))) 4))))))) (= v_main_~t~0_22 (+ (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 4) 1)) (= (mod (+ ~counter~0 1) 2) 0) (= (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 2) v_main_~a~0_22) (< 0 (div (+ (* ~counter~0 (- 1)) 1) (- 2)))) (and (= 0 v_main_~a~0_22) (= (+ ~counter~0 (- 1)) 0) (= v_main_~t~0_22 1))) (or (and (= (+ (* 2 v_main_~a~0_22) 1) v_main_~t~0_22) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 1)) (and (not (= (+ (* 2 v_main_~a~0_22) 1) v_main_~t~0_22)) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 0))) (or (and (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 1) (= (mod (+ main_~t~0 1) 2) 0)) (and (exists ((v_main_~a~0_23 Int)) (not (= main_~t~0 (+ (* 2 v_main_~a~0_23) 1)))) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 0)))))) ) not inductive [2022-04-28 08:01:14,591 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-28 08:01:14,774 WARN L477 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-28 08:01:14,775 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:109) 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:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:564) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:437) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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-28 08:01:14,778 INFO L158 Benchmark]: Toolchain (without parser) took 136326.38ms. Allocated memory was 177.2MB in the beginning and 248.5MB in the end (delta: 71.3MB). Free memory was 130.8MB in the beginning and 93.5MB in the end (delta: 37.3MB). Peak memory consumption was 109.3MB. Max. memory is 8.0GB. [2022-04-28 08:01:14,779 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 177.2MB. Free memory was 147.7MB in the beginning and 147.6MB in the end (delta: 88.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:01:14,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.76ms. Allocated memory is still 177.2MB. Free memory was 130.7MB in the beginning and 155.8MB in the end (delta: -25.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 08:01:14,779 INFO L158 Benchmark]: Boogie Preprocessor took 43.46ms. Allocated memory is still 177.2MB. Free memory was 155.8MB in the beginning and 154.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 08:01:14,779 INFO L158 Benchmark]: RCFGBuilder took 341.05ms. Allocated memory is still 177.2MB. Free memory was 154.3MB in the beginning and 143.5MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 08:01:14,780 INFO L158 Benchmark]: TraceAbstraction took 135601.38ms. Allocated memory was 177.2MB in the beginning and 248.5MB in the end (delta: 71.3MB). Free memory was 143.0MB in the beginning and 93.5MB in the end (delta: 49.5MB). Peak memory consumption was 122.5MB. Max. memory is 8.0GB. [2022-04-28 08:01:14,781 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.15ms. Allocated memory is still 177.2MB. Free memory was 147.7MB in the beginning and 147.6MB in the end (delta: 88.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 314.76ms. Allocated memory is still 177.2MB. Free memory was 130.7MB in the beginning and 155.8MB in the end (delta: -25.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.46ms. Allocated memory is still 177.2MB. Free memory was 155.8MB in the beginning and 154.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 341.05ms. Allocated memory is still 177.2MB. Free memory was 154.3MB in the beginning and 143.5MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 135601.38ms. Allocated memory was 177.2MB in the beginning and 248.5MB in the end (delta: 71.3MB). Free memory was 143.0MB in the beginning and 93.5MB in the end (delta: 49.5MB). Peak memory consumption was 122.5MB. 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-28 08:01:14,988 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-28 08:01:15,049 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...