/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 08:29:13,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 08:29:13,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 08:29:13,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 08:29:13,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 08:29:13,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 08:29:13,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 08:29:13,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 08:29:13,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 08:29:13,182 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 08:29:13,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 08:29:13,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 08:29:13,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 08:29:13,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 08:29:13,184 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 08:29:13,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 08:29:13,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 08:29:13,185 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 08:29:13,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 08:29:13,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 08:29:13,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 08:29:13,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 08:29:13,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 08:29:13,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 08:29:13,186 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 08:29:13,186 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 08:29:13,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 08:29:13,187 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 08:29:13,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 08:29:13,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 08:29:13,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 08:29:13,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 08:29:13,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 08:29:13,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 08:29:13,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 08:29:13,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 08:29:13,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 08:29:13,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 08:29:13,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 08:29:13,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 08:29:13,190 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 08:29:13,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 08:29:13,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 08:29:13,190 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 08:29:13,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 08:29:13,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 08:29:13,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 08:29:13,410 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 08:29:13,412 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 08:29:13,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound20.c [2023-12-21 08:29:14,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 08:29:14,613 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 08:29:14,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound20.c [2023-12-21 08:29:14,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0946518b2/42770ffafbae41a9a49213b20a95b431/FLAG10125839a [2023-12-21 08:29:14,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0946518b2/42770ffafbae41a9a49213b20a95b431 [2023-12-21 08:29:14,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 08:29:14,635 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 08:29:14,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 08:29:14,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 08:29:14,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 08:29:14,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:29:14" (1/1) ... [2023-12-21 08:29:14,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf9f929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:29:14, skipping insertion in model container [2023-12-21 08:29:14,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:29:14" (1/1) ... [2023-12-21 08:29:14,659 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 08:29:14,753 WARN L239 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/ps6-ll_valuebound20.c[458,471] [2023-12-21 08:29:14,765 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 08:29:14,772 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 08:29:14,780 WARN L239 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/ps6-ll_valuebound20.c[458,471] [2023-12-21 08:29:14,784 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 08:29:14,794 INFO L206 MainTranslator]: Completed translation [2023-12-21 08:29:14,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:29:14 WrapperNode [2023-12-21 08:29:14,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 08:29:14,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 08:29:14,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 08:29:14,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 08:29:14,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:29:14" (1/1) ... [2023-12-21 08:29:14,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:29:14" (1/1) ... [2023-12-21 08:29:14,817 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2023-12-21 08:29:14,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 08:29:14,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 08:29:14,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 08:29:14,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 08:29:14,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:29:14" (1/1) ... [2023-12-21 08:29:14,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:29:14" (1/1) ... [2023-12-21 08:29:14,838 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:29:14" (1/1) ... [2023-12-21 08:29:14,845 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-21 08:29:14,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:29:14" (1/1) ... [2023-12-21 08:29:14,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:29:14" (1/1) ... [2023-12-21 08:29:14,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:29:14" (1/1) ... [2023-12-21 08:29:14,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:29:14" (1/1) ... [2023-12-21 08:29:14,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:29:14" (1/1) ... [2023-12-21 08:29:14,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:29:14" (1/1) ... [2023-12-21 08:29:14,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 08:29:14,865 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 08:29:14,865 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 08:29:14,865 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 08:29:14,866 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:29:14" (1/1) ... [2023-12-21 08:29:14,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 08:29:14,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:29:14,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 08:29:14,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 08:29:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 08:29:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 08:29:14,916 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 08:29:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 08:29:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 08:29:14,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 08:29:14,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-21 08:29:14,917 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-21 08:29:14,958 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 08:29:14,959 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 08:29:15,111 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 08:29:15,131 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 08:29:15,131 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 08:29:15,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:29:15 BoogieIcfgContainer [2023-12-21 08:29:15,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 08:29:15,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 08:29:15,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 08:29:15,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 08:29:15,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 08:29:14" (1/3) ... [2023-12-21 08:29:15,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da7e3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:29:15, skipping insertion in model container [2023-12-21 08:29:15,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:29:14" (2/3) ... [2023-12-21 08:29:15,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da7e3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:29:15, skipping insertion in model container [2023-12-21 08:29:15,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:29:15" (3/3) ... [2023-12-21 08:29:15,138 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound20.c [2023-12-21 08:29:15,153 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 08:29:15,153 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 08:29:15,184 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 08:29:15,189 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@35f2127, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 08:29:15,189 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 08:29:15,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 08:29:15,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 08:29:15,197 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:29:15,198 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 08:29:15,198 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:29:15,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:29:15,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1419667615, now seen corresponding path program 1 times [2023-12-21 08:29:15,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:29:15,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197363847] [2023-12-21 08:29:15,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:29:15,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:29:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 08:29:15,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:29:15,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197363847] [2023-12-21 08:29:15,289 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-21 08:29:15,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141853037] [2023-12-21 08:29:15,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:29:15,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:29:15,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:29:15,292 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) [2023-12-21 08:29:15,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 08:29:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 08:29:15,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 08:29:15,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:29:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 08:29:15,365 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 08:29:15,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141853037] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 08:29:15,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 08:29:15,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 08:29:15,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550965091] [2023-12-21 08:29:15,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 08:29:15,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 08:29:15,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:29:15,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 08:29:15,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 08:29:15,399 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 08:29:15,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:29:15,418 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2023-12-21 08:29:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 08:29:15,421 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-12-21 08:29:15,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:29:15,426 INFO L225 Difference]: With dead ends: 40 [2023-12-21 08:29:15,427 INFO L226 Difference]: Without dead ends: 19 [2023-12-21 08:29:15,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 08:29:15,432 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 08:29:15,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 08:29:15,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-21 08:29:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-21 08:29:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 08:29:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-12-21 08:29:15,498 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2023-12-21 08:29:15,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:29:15,498 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-12-21 08:29:15,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 08:29:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-12-21 08:29:15,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 08:29:15,500 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:29:15,501 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 08:29:15,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 08:29:15,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-21 08:29:15,707 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:29:15,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:29:15,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1758174245, now seen corresponding path program 1 times [2023-12-21 08:29:15,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:29:15,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801600496] [2023-12-21 08:29:15,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:29:15,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:29:15,728 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 08:29:15,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [405583386] [2023-12-21 08:29:15,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:29:15,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:29:15,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:29:15,730 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) [2023-12-21 08:29:15,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 08:29:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 08:29:15,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-21 08:29:15,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:29:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 08:29:15,897 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 08:29:15,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:29:15,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801600496] [2023-12-21 08:29:15,897 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 08:29:15,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405583386] [2023-12-21 08:29:15,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405583386] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 08:29:15,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 08:29:15,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 08:29:15,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007984555] [2023-12-21 08:29:15,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 08:29:15,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 08:29:15,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:29:15,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 08:29:15,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 08:29:15,900 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 08:29:15,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:29:15,999 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2023-12-21 08:29:15,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 08:29:16,000 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-21 08:29:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:29:16,000 INFO L225 Difference]: With dead ends: 30 [2023-12-21 08:29:16,000 INFO L226 Difference]: Without dead ends: 26 [2023-12-21 08:29:16,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-21 08:29:16,002 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 08:29:16,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 68 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 08:29:16,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-21 08:29:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-21 08:29:16,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 08:29:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-21 08:29:16,007 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2023-12-21 08:29:16,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:29:16,007 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-21 08:29:16,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 08:29:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-21 08:29:16,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-21 08:29:16,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:29:16,008 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 08:29:16,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 08:29:16,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-21 08:29:16,209 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:29:16,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:29:16,210 INFO L85 PathProgramCache]: Analyzing trace with hash -795669560, now seen corresponding path program 1 times [2023-12-21 08:29:16,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:29:16,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794541195] [2023-12-21 08:29:16,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:29:16,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:29:16,234 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 08:29:16,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [378306572] [2023-12-21 08:29:16,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:29:16,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:29:16,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:29:16,236 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) [2023-12-21 08:29:16,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 08:29:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 08:29:16,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 08:29:16,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:29:16,332 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 08:29:16,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 08:29:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 08:29:16,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:29:16,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794541195] [2023-12-21 08:29:16,689 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 08:29:16,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378306572] [2023-12-21 08:29:16,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378306572] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 08:29:16,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 08:29:16,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-12-21 08:29:16,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468052508] [2023-12-21 08:29:16,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 08:29:16,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 08:29:16,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:29:16,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 08:29:16,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-21 08:29:16,690 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 08:29:16,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:29:16,751 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-12-21 08:29:16,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 08:29:16,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-12-21 08:29:16,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:29:16,752 INFO L225 Difference]: With dead ends: 32 [2023-12-21 08:29:16,752 INFO L226 Difference]: Without dead ends: 28 [2023-12-21 08:29:16,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-21 08:29:16,754 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 08:29:16,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 57 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 08:29:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-21 08:29:16,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-21 08:29:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 08:29:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2023-12-21 08:29:16,763 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2023-12-21 08:29:16,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:29:16,763 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2023-12-21 08:29:16,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 08:29:16,764 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2023-12-21 08:29:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-21 08:29:16,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:29:16,765 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 08:29:16,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 08:29:16,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:29:16,973 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:29:16,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:29:16,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1266135666, now seen corresponding path program 1 times [2023-12-21 08:29:16,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:29:16,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635616773] [2023-12-21 08:29:16,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:29:16,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:29:16,988 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 08:29:16,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [331138574] [2023-12-21 08:29:16,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:29:16,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:29:16,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:29:16,996 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 08:29:16,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-21 08:29:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 08:29:17,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-21 08:29:17,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:29:17,186 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 08:29:17,186 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 08:29:25,481 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (.cse1 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2))) (or (= (+ |c_ULTIMATE.start_main_~y~0#1| .cse0) (+ |c_ULTIMATE.start_main_~c~0#1| (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 5) .cse1 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 11) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))) (< (+ (* .cse0 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) |c_ULTIMATE.start_main_~x~0#1| (* 5 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (div (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 18) .cse1 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 119) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 65)) 12)))) is different from false [2023-12-21 08:29:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 3 not checked. [2023-12-21 08:29:33,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:29:33,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635616773] [2023-12-21 08:29:33,571 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 08:29:33,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331138574] [2023-12-21 08:29:33,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331138574] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 08:29:33,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 08:29:33,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-12-21 08:29:33,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418858900] [2023-12-21 08:29:33,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 08:29:33,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 08:29:33,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:29:33,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 08:29:33,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=165, Unknown=1, NotChecked=26, Total=240 [2023-12-21 08:29:33,573 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 16 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 9 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-21 08:29:33,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:29:33,714 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2023-12-21 08:29:33,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 08:29:33,714 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 9 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 35 [2023-12-21 08:29:33,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:29:33,715 INFO L225 Difference]: With dead ends: 37 [2023-12-21 08:29:33,715 INFO L226 Difference]: Without dead ends: 31 [2023-12-21 08:29:33,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=71, Invalid=238, Unknown=1, NotChecked=32, Total=342 [2023-12-21 08:29:33,716 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 08:29:33,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 140 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 16 Unchecked, 0.1s Time] [2023-12-21 08:29:33,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-21 08:29:33,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-21 08:29:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 08:29:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2023-12-21 08:29:33,722 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 35 [2023-12-21 08:29:33,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:29:33,723 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-12-21 08:29:33,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 9 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-21 08:29:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2023-12-21 08:29:33,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-21 08:29:33,724 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:29:33,724 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 08:29:33,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-21 08:29:33,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:29:33,929 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:29:33,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:29:33,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1244194529, now seen corresponding path program 2 times [2023-12-21 08:29:33,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:29:33,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752353652] [2023-12-21 08:29:33,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:29:33,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:29:33,939 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 08:29:33,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1620553197] [2023-12-21 08:29:33,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 08:29:33,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:29:33,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:29:33,957 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 08:29:33,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-21 08:29:34,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 08:29:34,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 08:29:34,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 08:29:34,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:29:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-21 08:29:34,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 08:29:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-21 08:29:34,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:29:34,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752353652] [2023-12-21 08:29:34,271 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 08:29:34,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620553197] [2023-12-21 08:29:34,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620553197] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 08:29:34,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 08:29:34,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2023-12-21 08:29:34,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922606868] [2023-12-21 08:29:34,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 08:29:34,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-21 08:29:34,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:29:34,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-21 08:29:34,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-12-21 08:29:34,281 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 9 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2023-12-21 08:29:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:29:34,576 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2023-12-21 08:29:34,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 08:29:34,577 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 9 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) Word has length 42 [2023-12-21 08:29:34,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:29:34,578 INFO L225 Difference]: With dead ends: 50 [2023-12-21 08:29:34,578 INFO L226 Difference]: Without dead ends: 42 [2023-12-21 08:29:34,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2023-12-21 08:29:34,579 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 08:29:34,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 193 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 08:29:34,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-21 08:29:34,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2023-12-21 08:29:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-21 08:29:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2023-12-21 08:29:34,592 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 42 [2023-12-21 08:29:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:29:34,592 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2023-12-21 08:29:34,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 9 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2023-12-21 08:29:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2023-12-21 08:29:34,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-21 08:29:34,595 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:29:34,596 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 08:29:34,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-21 08:29:34,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:29:34,801 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:29:34,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:29:34,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1662742834, now seen corresponding path program 3 times [2023-12-21 08:29:34,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:29:34,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926615909] [2023-12-21 08:29:34,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:29:34,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:29:34,833 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 08:29:34,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [297757882] [2023-12-21 08:29:34,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 08:29:34,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:29:34,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:29:34,835 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 08:29:34,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-21 08:29:34,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-21 08:29:34,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 08:29:34,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-21 08:29:34,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:29:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 55 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-21 08:29:35,133 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 08:29:43,265 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))) (= (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (+ (* |c_ULTIMATE.start_main_~c~0#1| 2) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))))) is different from false [2023-12-21 08:29:51,303 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:29:59,312 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:30:15,352 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:30:19,359 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32|))) (or (= (mod (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| 6) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| 7) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| 10)) 12) 0) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_19|) (* |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_19| 2)) (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| 2))))))) is different from true [2023-12-21 08:30:35,396 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:30:51,427 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:30:55,435 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32|))) (or (= (mod (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| 6) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| 7) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| 10)) 12) 0) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_19|) (* |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_19| 2)) (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_32| 2)))))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-12-21 08:31:07,462 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| 3) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 3))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2023-12-21 08:31:23,514 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~c~0#1| 4)) (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 4))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2023-12-21 08:31:40,814 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~c~0#1| 5)) (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 5))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2023-12-21 08:31:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 5 refuted. 9 times theorem prover too weak. 70 trivial. 41 not checked. [2023-12-21 08:31:48,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:31:48,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926615909] [2023-12-21 08:31:48,849 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 08:31:48,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297757882] [2023-12-21 08:31:48,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297757882] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 08:31:48,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 08:31:48,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-12-21 08:31:48,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022044151] [2023-12-21 08:31:48,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 08:31:48,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 08:31:48,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:31:48,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 08:31:48,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=261, Unknown=6, NotChecked=222, Total=552 [2023-12-21 08:31:48,851 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 24 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 15 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2023-12-21 08:31:49,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:31:49,221 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2023-12-21 08:31:49,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 08:31:49,222 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 15 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 63 [2023-12-21 08:31:49,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:31:49,222 INFO L225 Difference]: With dead ends: 45 [2023-12-21 08:31:49,223 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 08:31:49,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=136, Invalid=638, Unknown=6, NotChecked=342, Total=1122 [2023-12-21 08:31:49,224 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 08:31:49,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 290 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 184 Invalid, 0 Unknown, 203 Unchecked, 0.1s Time] [2023-12-21 08:31:49,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 08:31:49,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 08:31:49,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 08:31:49,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 08:31:49,225 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2023-12-21 08:31:49,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:31:49,225 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 08:31:49,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 15 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2023-12-21 08:31:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 08:31:49,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 08:31:49,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 08:31:49,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-21 08:31:49,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:31:49,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 08:31:49,897 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 08:31:49,897 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= (+ |ULTIMATE.start_main_~y~0#1| .cse0) (+ |ULTIMATE.start_main_~c~0#1| .cse1)) (= (+ (* 2 |ULTIMATE.start_main_~c~0#1|) .cse1) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) .cse0)) (= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) .cse0)) (or (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse0) (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 256))) [2023-12-21 08:31:49,897 INFO L899 garLoopResultBuilder]: For program point L29-1(lines 28 37) no Hoare annotation was computed. [2023-12-21 08:31:49,897 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2023-12-21 08:31:49,897 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (<= |ULTIMATE.start_main_~k~0#1| 256) [2023-12-21 08:31:49,897 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 08:31:49,897 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2023-12-21 08:31:49,897 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= (+ |ULTIMATE.start_main_~y~0#1| .cse0) (+ |ULTIMATE.start_main_~c~0#1| .cse1)) (= (+ (* 2 |ULTIMATE.start_main_~c~0#1|) .cse1) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) .cse0)) (= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) .cse0)) (or (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse0) (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 256))) [2023-12-21 08:31:49,898 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (or (let ((.cse0 (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= .cse0 .cse1) (or (not (= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)) (= (+ |ULTIMATE.start_main_~k~0#1| .cse0) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) .cse1 1))) (or (= (+ (* |ULTIMATE.start_main_~y~0#1| 4) 4 .cse1) (+ (* 2 |ULTIMATE.start_main_~k~0#1|) .cse0)) (not (= |ULTIMATE.start_main_~k~0#1| (+ 2 |ULTIMATE.start_main_~c~0#1|)))) (= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) .cse1)) (<= |ULTIMATE.start_main_~k~0#1| 256))) (and (= |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1)) (and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))) [2023-12-21 08:31:49,898 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2023-12-21 08:31:49,898 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (or (let ((.cse0 (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= .cse0 .cse1) (or (not (= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)) (= (+ |ULTIMATE.start_main_~k~0#1| .cse0) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) .cse1 1))) (or (= (+ (* |ULTIMATE.start_main_~y~0#1| 4) 4 .cse1) (+ (* 2 |ULTIMATE.start_main_~k~0#1|) .cse0)) (not (= |ULTIMATE.start_main_~k~0#1| (+ 2 |ULTIMATE.start_main_~c~0#1|)))) (= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) .cse1)) (<= |ULTIMATE.start_main_~k~0#1| 256))) (and (= |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1)) (and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))) [2023-12-21 08:31:49,898 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6 8) the Hoare annotation is: true [2023-12-21 08:31:49,898 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-12-21 08:31:49,898 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2023-12-21 08:31:49,898 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2023-12-21 08:31:49,898 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2023-12-21 08:31:49,898 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2023-12-21 08:31:49,898 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2023-12-21 08:31:49,898 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2023-12-21 08:31:49,898 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2023-12-21 08:31:49,899 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2023-12-21 08:31:49,905 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2023-12-21 08:31:49,907 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 08:31:49,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 08:31:49 BoogieIcfgContainer [2023-12-21 08:31:49,921 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 08:31:49,921 INFO L158 Benchmark]: Toolchain (without parser) took 155286.17ms. Allocated memory was 178.3MB in the beginning and 230.7MB in the end (delta: 52.4MB). Free memory was 132.8MB in the beginning and 91.9MB in the end (delta: 40.8MB). Peak memory consumption was 95.0MB. Max. memory is 8.0GB. [2023-12-21 08:31:49,921 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 178.3MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 08:31:49,921 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.95ms. Allocated memory is still 178.3MB. Free memory was 132.8MB in the beginning and 121.6MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 08:31:49,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.23ms. Allocated memory is still 178.3MB. Free memory was 121.6MB in the beginning and 120.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 08:31:49,922 INFO L158 Benchmark]: Boogie Preprocessor took 45.82ms. Allocated memory is still 178.3MB. Free memory was 120.2MB in the beginning and 118.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 08:31:49,922 INFO L158 Benchmark]: RCFGBuilder took 266.93ms. Allocated memory is still 178.3MB. Free memory was 118.5MB in the beginning and 107.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-21 08:31:49,922 INFO L158 Benchmark]: TraceAbstraction took 154787.54ms. Allocated memory was 178.3MB in the beginning and 230.7MB in the end (delta: 52.4MB). Free memory was 106.5MB in the beginning and 92.0MB in the end (delta: 14.6MB). Peak memory consumption was 67.8MB. Max. memory is 8.0GB. [2023-12-21 08:31:49,924 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 178.3MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 158.95ms. Allocated memory is still 178.3MB. Free memory was 132.8MB in the beginning and 121.6MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.23ms. Allocated memory is still 178.3MB. Free memory was 121.6MB in the beginning and 120.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.82ms. Allocated memory is still 178.3MB. Free memory was 120.2MB in the beginning and 118.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 266.93ms. Allocated memory is still 178.3MB. Free memory was 118.5MB in the beginning and 107.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 154787.54ms. Allocated memory was 178.3MB in the beginning and 230.7MB in the end (delta: 52.4MB). Free memory was 106.5MB in the beginning and 92.0MB in the end (delta: 14.6MB). Peak memory consumption was 67.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 154.7s, OverallIterations: 6, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 770 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 219 IncrementalHoareTripleChecker+Unchecked, 656 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 508 IncrementalHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 114 mSDtfsCounter, 508 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 381 GetRequests, 289 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 30.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=5, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 31 PreInvPairs, 58 NumberOfFragments, 366 HoareAnnotationTreeSize, 31 FormulaSimplifications, 801 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FormulaSimplificationsInter, 534 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 151.2s InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 352 ConstructedInterpolants, 3 QuantifiedInterpolants, 2308 SizeOfPredicates, 18 NumberOfNonLiveVariables, 552 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 320/458 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((y + (y * y)) == (c + (c * y))) && (((2 * c) + (c * y)) == ((2 * y) + (y * y)))) && ((((6 * ((((y * y) * y) * y) * y)) + (2 * (((((y * y) * y) * y) * y) * y))) + (5 * (((y * y) * y) * y))) == ((x * 12) + (y * y)))) && (((k * y) == (y * y)) || (c < k))) && (k <= 256)) RESULT: Ultimate proved your program to be correct! [2023-12-21 08:31:49,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...