/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/cohencu-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 05:42:38,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 05:42:38,514 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 05:42:38,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 05:42:38,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 05:42:38,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 05:42:38,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 05:42:38,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 05:42:38,540 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 05:42:38,540 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 05:42:38,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 05:42:38,541 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 05:42:38,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 05:42:38,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 05:42:38,542 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 05:42:38,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 05:42:38,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 05:42:38,543 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 05:42:38,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 05:42:38,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 05:42:38,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 05:42:38,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 05:42:38,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 05:42:38,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 05:42:38,545 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 05:42:38,546 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 05:42:38,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 05:42:38,546 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 05:42:38,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 05:42:38,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 05:42:38,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 05:42:38,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 05:42:38,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 05:42:38,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 05:42:38,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 05:42:38,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 05:42:38,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 05:42:38,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 05:42:38,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 05:42:38,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 05:42:38,550 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 05:42:38,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 05:42:38,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 05:42:38,551 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 05:42:38,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 05:42:38,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 05:42:38,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 05:42:38,800 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 05:42:38,804 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 05:42:38,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2023-12-21 05:42:39,981 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 05:42:40,134 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 05:42:40,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2023-12-21 05:42:40,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa20f12d7/31881b8536e64361987c6a6da170c9ac/FLAG65b1358ba [2023-12-21 05:42:40,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa20f12d7/31881b8536e64361987c6a6da170c9ac [2023-12-21 05:42:40,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 05:42:40,152 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 05:42:40,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 05:42:40,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 05:42:40,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 05:42:40,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:42:40" (1/1) ... [2023-12-21 05:42:40,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697d9730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:42:40, skipping insertion in model container [2023-12-21 05:42:40,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:42:40" (1/1) ... [2023-12-21 05:42:40,179 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 05:42:40,329 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/cohencu-ll_unwindbound20.c[588,601] [2023-12-21 05:42:40,354 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 05:42:40,362 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 05:42:40,371 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/cohencu-ll_unwindbound20.c[588,601] [2023-12-21 05:42:40,380 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 05:42:40,392 INFO L206 MainTranslator]: Completed translation [2023-12-21 05:42:40,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:42:40 WrapperNode [2023-12-21 05:42:40,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 05:42:40,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 05:42:40,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 05:42:40,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 05:42:40,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:42:40" (1/1) ... [2023-12-21 05:42:40,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:42:40" (1/1) ... [2023-12-21 05:42:40,428 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2023-12-21 05:42:40,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 05:42:40,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 05:42:40,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 05:42:40,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 05:42:40,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:42:40" (1/1) ... [2023-12-21 05:42:40,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:42:40" (1/1) ... [2023-12-21 05:42:40,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:42:40" (1/1) ... [2023-12-21 05:42:40,446 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 05:42:40,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:42:40" (1/1) ... [2023-12-21 05:42:40,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:42:40" (1/1) ... [2023-12-21 05:42:40,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:42:40" (1/1) ... [2023-12-21 05:42:40,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:42:40" (1/1) ... [2023-12-21 05:42:40,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:42:40" (1/1) ... [2023-12-21 05:42:40,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:42:40" (1/1) ... [2023-12-21 05:42:40,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 05:42:40,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 05:42:40,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 05:42:40,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 05:42:40,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:42:40" (1/1) ... [2023-12-21 05:42:40,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 05:42:40,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:42:40,481 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 05:42:40,484 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 05:42:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 05:42:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 05:42:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 05:42:40,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 05:42:40,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-21 05:42:40,504 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-21 05:42:40,546 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 05:42:40,548 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 05:42:40,701 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 05:42:40,720 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 05:42:40,721 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 05:42:40,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:42:40 BoogieIcfgContainer [2023-12-21 05:42:40,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 05:42:40,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 05:42:40,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 05:42:40,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 05:42:40,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 05:42:40" (1/3) ... [2023-12-21 05:42:40,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7b994f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:42:40, skipping insertion in model container [2023-12-21 05:42:40,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:42:40" (2/3) ... [2023-12-21 05:42:40,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7b994f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:42:40, skipping insertion in model container [2023-12-21 05:42:40,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:42:40" (3/3) ... [2023-12-21 05:42:40,728 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound20.c [2023-12-21 05:42:40,741 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 05:42:40,742 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 05:42:40,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 05:42:40,788 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;@77e62a4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 05:42:40,788 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 05:42:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-21 05:42:40,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-21 05:42:40,798 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:42:40,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-21 05:42:40,799 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:42:40,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:42:40,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1379524608, now seen corresponding path program 1 times [2023-12-21 05:42:40,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:42:40,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207632655] [2023-12-21 05:42:40,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:40,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:42:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:42:40,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 05:42:40,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:42:40,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207632655] [2023-12-21 05:42:40,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207632655] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 05:42:40,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 05:42:40,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 05:42:40,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450160724] [2023-12-21 05:42:40,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 05:42:40,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 05:42:40,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:42:41,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 05:42:41,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 05:42:41,012 INFO L87 Difference]: Start difference. First operand has 23 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:42:41,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:42:41,062 INFO L93 Difference]: Finished difference Result 45 states and 82 transitions. [2023-12-21 05:42:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 05:42:41,065 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-21 05:42:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:42:41,070 INFO L225 Difference]: With dead ends: 45 [2023-12-21 05:42:41,070 INFO L226 Difference]: Without dead ends: 21 [2023-12-21 05:42:41,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 05:42:41,076 INFO L413 NwaCegarLoop]: 32 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, 32 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 05:42:41,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 05:42:41,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-21 05:42:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-21 05:42:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-21 05:42:41,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2023-12-21 05:42:41,126 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 32 transitions. Word has length 6 [2023-12-21 05:42:41,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:42:41,127 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 32 transitions. [2023-12-21 05:42:41,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:42:41,127 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 32 transitions. [2023-12-21 05:42:41,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-21 05:42:41,127 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:42:41,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:42:41,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 05:42:41,128 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:42:41,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:42:41,129 INFO L85 PathProgramCache]: Analyzing trace with hash -345068235, now seen corresponding path program 1 times [2023-12-21 05:42:41,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:42:41,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795099602] [2023-12-21 05:42:41,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:41,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:42:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:42:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 05:42:41,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:42:41,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795099602] [2023-12-21 05:42:41,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795099602] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 05:42:41,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 05:42:41,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 05:42:41,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577078474] [2023-12-21 05:42:41,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 05:42:41,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 05:42:41,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:42:41,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 05:42:41,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 05:42:41,269 INFO L87 Difference]: Start difference. First operand 21 states and 32 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:42:41,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:42:41,303 INFO L93 Difference]: Finished difference Result 35 states and 51 transitions. [2023-12-21 05:42:41,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 05:42:41,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-21 05:42:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:42:41,306 INFO L225 Difference]: With dead ends: 35 [2023-12-21 05:42:41,306 INFO L226 Difference]: Without dead ends: 23 [2023-12-21 05:42:41,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 05:42:41,308 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 05:42:41,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 05:42:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-21 05:42:41,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-21 05:42:41,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-21 05:42:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2023-12-21 05:42:41,315 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 7 [2023-12-21 05:42:41,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:42:41,315 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2023-12-21 05:42:41,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:42:41,316 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2023-12-21 05:42:41,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-21 05:42:41,319 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:42:41,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:42:41,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 05:42:41,320 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:42:41,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:42:41,322 INFO L85 PathProgramCache]: Analyzing trace with hash -343519103, now seen corresponding path program 1 times [2023-12-21 05:42:41,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:42:41,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164037490] [2023-12-21 05:42:41,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:41,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:42:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:42:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 05:42:41,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:42:41,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164037490] [2023-12-21 05:42:41,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164037490] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 05:42:41,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 05:42:41,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 05:42:41,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847135455] [2023-12-21 05:42:41,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 05:42:41,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 05:42:41,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:42:41,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 05:42:41,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 05:42:41,470 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:42:41,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:42:41,534 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2023-12-21 05:42:41,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 05:42:41,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-21 05:42:41,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:42:41,535 INFO L225 Difference]: With dead ends: 29 [2023-12-21 05:42:41,535 INFO L226 Difference]: Without dead ends: 27 [2023-12-21 05:42:41,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 05:42:41,537 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 05:42:41,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 77 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 05:42:41,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-21 05:42:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-21 05:42:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-21 05:42:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2023-12-21 05:42:41,549 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 7 [2023-12-21 05:42:41,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:42:41,549 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2023-12-21 05:42:41,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:42:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2023-12-21 05:42:41,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 05:42:41,550 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:42:41,550 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:42:41,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 05:42:41,550 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:42:41,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:42:41,551 INFO L85 PathProgramCache]: Analyzing trace with hash -875596316, now seen corresponding path program 1 times [2023-12-21 05:42:41,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:42:41,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566989292] [2023-12-21 05:42:41,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:41,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:42:41,572 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:42:41,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1809639476] [2023-12-21 05:42:41,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:41,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:41,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:42:41,575 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 05:42:41,592 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 05:42:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:42:41,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-21 05:42:41,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:42:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 05:42:41,758 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:42:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 05:42:41,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:42:41,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566989292] [2023-12-21 05:42:41,922 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:42:41,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809639476] [2023-12-21 05:42:41,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809639476] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:42:41,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 05:42:41,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-12-21 05:42:41,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165405505] [2023-12-21 05:42:41,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 05:42:41,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 05:42:41,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:42:41,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 05:42:41,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-21 05:42:41,929 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 12 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 05:42:42,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:42:42,228 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2023-12-21 05:42:42,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 05:42:42,229 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 12 [2023-12-21 05:42:42,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:42:42,231 INFO L225 Difference]: With dead ends: 53 [2023-12-21 05:42:42,231 INFO L226 Difference]: Without dead ends: 51 [2023-12-21 05:42:42,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-12-21 05:42:42,232 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 05:42:42,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 74 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 05:42:42,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-21 05:42:42,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2023-12-21 05:42:42,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-21 05:42:42,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2023-12-21 05:42:42,250 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 12 [2023-12-21 05:42:42,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:42:42,250 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2023-12-21 05:42:42,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 05:42:42,250 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2023-12-21 05:42:42,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 05:42:42,251 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:42:42,251 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:42:42,257 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 05:42:42,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:42,456 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:42:42,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:42:42,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2105691681, now seen corresponding path program 1 times [2023-12-21 05:42:42,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:42:42,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268437300] [2023-12-21 05:42:42,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:42,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:42:42,464 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:42:42,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1038659105] [2023-12-21 05:42:42,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:42,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:42,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:42:42,508 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 05:42:42,510 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 05:42:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:42:42,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-21 05:42:42,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:42:42,603 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 05:42:42,603 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:42:42,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 05:42:42,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:42:42,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268437300] [2023-12-21 05:42:42,710 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:42:42,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038659105] [2023-12-21 05:42:42,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038659105] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:42:42,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 05:42:42,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-12-21 05:42:42,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073402091] [2023-12-21 05:42:42,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 05:42:42,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 05:42:42,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:42:42,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 05:42:42,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-21 05:42:42,712 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 12 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 05:42:42,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:42:42,994 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2023-12-21 05:42:42,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 05:42:42,995 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17 [2023-12-21 05:42:42,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:42:42,996 INFO L225 Difference]: With dead ends: 59 [2023-12-21 05:42:42,996 INFO L226 Difference]: Without dead ends: 57 [2023-12-21 05:42:42,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-12-21 05:42:42,998 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 05:42:42,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 95 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 05:42:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-21 05:42:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2023-12-21 05:42:43,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-21 05:42:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2023-12-21 05:42:43,024 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 17 [2023-12-21 05:42:43,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:42:43,024 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2023-12-21 05:42:43,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 05:42:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2023-12-21 05:42:43,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 05:42:43,025 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:42:43,026 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:42:43,034 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 05:42:43,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:43,231 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:42:43,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:42:43,232 INFO L85 PathProgramCache]: Analyzing trace with hash 168504260, now seen corresponding path program 1 times [2023-12-21 05:42:43,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:42:43,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464372752] [2023-12-21 05:42:43,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:43,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:42:43,241 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:42:43,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1652963561] [2023-12-21 05:42:43,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:43,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:43,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:42:43,251 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 05:42:43,252 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 05:42:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:42:43,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-21 05:42:43,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:42:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 05:42:43,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:42:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 05:42:43,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:42:43,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464372752] [2023-12-21 05:42:43,917 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:42:43,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652963561] [2023-12-21 05:42:43,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652963561] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:42:43,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 05:42:43,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-12-21 05:42:43,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626961727] [2023-12-21 05:42:43,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 05:42:43,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 05:42:43,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:42:43,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 05:42:43,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-21 05:42:43,919 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 12 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 05:42:44,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:42:44,564 INFO L93 Difference]: Finished difference Result 73 states and 99 transitions. [2023-12-21 05:42:44,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 05:42:44,565 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) Word has length 22 [2023-12-21 05:42:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:42:44,566 INFO L225 Difference]: With dead ends: 73 [2023-12-21 05:42:44,566 INFO L226 Difference]: Without dead ends: 64 [2023-12-21 05:42:44,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-12-21 05:42:44,567 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 05:42:44,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 117 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 05:42:44,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-21 05:42:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-21 05:42:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 34 states have internal predecessors, (35), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 05:42:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2023-12-21 05:42:44,596 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 22 [2023-12-21 05:42:44,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:42:44,596 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2023-12-21 05:42:44,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 05:42:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2023-12-21 05:42:44,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-21 05:42:44,598 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:42:44,598 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:42:44,606 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 05:42:44,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:44,806 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:42:44,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:42:44,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1666200982, now seen corresponding path program 1 times [2023-12-21 05:42:44,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:42:44,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269583537] [2023-12-21 05:42:44,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:44,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:42:44,815 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:42:44,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1420798432] [2023-12-21 05:42:44,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:44,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:44,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:42:44,817 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 05:42:44,824 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 05:42:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:42:44,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 05:42:44,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:42:44,908 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-12-21 05:42:44,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:42:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-21 05:42:44,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:42:44,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269583537] [2023-12-21 05:42:44,955 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:42:44,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420798432] [2023-12-21 05:42:44,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420798432] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:42:44,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 05:42:44,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-21 05:42:44,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887793681] [2023-12-21 05:42:44,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 05:42:44,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 05:42:44,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:42:44,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 05:42:44,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-21 05:42:44,959 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 05:42:45,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:42:45,105 INFO L93 Difference]: Finished difference Result 139 states and 176 transitions. [2023-12-21 05:42:45,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 05:42:45,106 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 40 [2023-12-21 05:42:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:42:45,107 INFO L225 Difference]: With dead ends: 139 [2023-12-21 05:42:45,107 INFO L226 Difference]: Without dead ends: 118 [2023-12-21 05:42:45,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-21 05:42:45,108 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 47 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 05:42:45,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 110 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 05:42:45,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-21 05:42:45,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2023-12-21 05:42:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 62 states have internal predecessors, (65), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-21 05:42:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 143 transitions. [2023-12-21 05:42:45,148 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 143 transitions. Word has length 40 [2023-12-21 05:42:45,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:42:45,149 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 143 transitions. [2023-12-21 05:42:45,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 05:42:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 143 transitions. [2023-12-21 05:42:45,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-21 05:42:45,150 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:42:45,150 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:42:45,158 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 05:42:45,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:45,355 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:42:45,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:42:45,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1054982331, now seen corresponding path program 1 times [2023-12-21 05:42:45,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:42:45,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875859758] [2023-12-21 05:42:45,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:45,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:42:45,363 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:42:45,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [71860308] [2023-12-21 05:42:45,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:45,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:45,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:42:45,365 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 05:42:45,383 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 05:42:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:42:45,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-21 05:42:45,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:42:45,535 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-21 05:42:45,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:42:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-21 05:42:45,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:42:45,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875859758] [2023-12-21 05:42:45,667 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:42:45,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71860308] [2023-12-21 05:42:45,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71860308] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:42:45,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 05:42:45,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-12-21 05:42:45,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527399526] [2023-12-21 05:42:45,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 05:42:45,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 05:42:45,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:42:45,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 05:42:45,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-12-21 05:42:45,669 INFO L87 Difference]: Start difference. First operand 114 states and 143 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-12-21 05:42:49,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:42:50,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:42:50,004 INFO L93 Difference]: Finished difference Result 128 states and 156 transitions. [2023-12-21 05:42:50,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 05:42:50,005 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 45 [2023-12-21 05:42:50,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:42:50,006 INFO L225 Difference]: With dead ends: 128 [2023-12-21 05:42:50,006 INFO L226 Difference]: Without dead ends: 126 [2023-12-21 05:42:50,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-12-21 05:42:50,007 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-21 05:42:50,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 157 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 239 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2023-12-21 05:42:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-21 05:42:50,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-12-21 05:42:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 71 states have internal predecessors, (74), 41 states have call successors, (41), 17 states have call predecessors, (41), 17 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-21 05:42:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 152 transitions. [2023-12-21 05:42:50,052 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 152 transitions. Word has length 45 [2023-12-21 05:42:50,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:42:50,053 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 152 transitions. [2023-12-21 05:42:50,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-12-21 05:42:50,053 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 152 transitions. [2023-12-21 05:42:50,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-21 05:42:50,054 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:42:50,054 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-12-21 05:42:50,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-21 05:42:50,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:50,259 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:42:50,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:42:50,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2020348453, now seen corresponding path program 2 times [2023-12-21 05:42:50,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:42:50,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823465581] [2023-12-21 05:42:50,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:50,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:42:50,267 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:42:50,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1503404520] [2023-12-21 05:42:50,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 05:42:50,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:50,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:42:50,272 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 05:42:50,298 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 05:42:50,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 05:42:50,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 05:42:50,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-21 05:42:50,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:42:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-21 05:42:50,434 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:42:50,593 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 20 proven. 25 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-21 05:42:50,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:42:50,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823465581] [2023-12-21 05:42:50,594 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:42:50,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503404520] [2023-12-21 05:42:50,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503404520] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:42:50,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 05:42:50,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-12-21 05:42:50,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518702245] [2023-12-21 05:42:50,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 05:42:50,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 05:42:50,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:42:50,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 05:42:50,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-21 05:42:50,595 INFO L87 Difference]: Start difference. First operand 126 states and 152 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-21 05:42:50,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:42:50,780 INFO L93 Difference]: Finished difference Result 140 states and 165 transitions. [2023-12-21 05:42:50,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 05:42:50,780 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 55 [2023-12-21 05:42:50,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:42:50,783 INFO L225 Difference]: With dead ends: 140 [2023-12-21 05:42:50,783 INFO L226 Difference]: Without dead ends: 134 [2023-12-21 05:42:50,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-12-21 05:42:50,785 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 21 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 05:42:50,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 99 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 05:42:50,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-21 05:42:50,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-12-21 05:42:50,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 80 states have internal predecessors, (83), 37 states have call successors, (37), 20 states have call predecessors, (37), 20 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-21 05:42:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions. [2023-12-21 05:42:50,828 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 55 [2023-12-21 05:42:50,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:42:50,828 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 153 transitions. [2023-12-21 05:42:50,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-21 05:42:50,829 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions. [2023-12-21 05:42:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-21 05:42:50,833 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:42:50,833 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:42:50,840 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 05:42:51,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:51,039 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:42:51,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:42:51,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1733391679, now seen corresponding path program 1 times [2023-12-21 05:42:51,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:42:51,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279275385] [2023-12-21 05:42:51,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:51,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:42:51,047 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:42:51,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [74808016] [2023-12-21 05:42:51,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:51,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:51,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:42:51,049 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:42:51,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-21 05:42:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:42:51,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-21 05:42:51,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:42:51,429 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 21 proven. 39 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-21 05:42:51,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:42:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-21 05:42:51,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:42:51,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279275385] [2023-12-21 05:42:51,625 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:42:51,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74808016] [2023-12-21 05:42:51,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74808016] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:42:51,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 05:42:51,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-12-21 05:42:51,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691438518] [2023-12-21 05:42:51,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 05:42:51,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 05:42:51,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:42:51,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 05:42:51,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-12-21 05:42:51,627 INFO L87 Difference]: Start difference. First operand 134 states and 153 transitions. Second operand has 14 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2023-12-21 05:42:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:42:52,305 INFO L93 Difference]: Finished difference Result 148 states and 166 transitions. [2023-12-21 05:42:52,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 05:42:52,306 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 66 [2023-12-21 05:42:52,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:42:52,307 INFO L225 Difference]: With dead ends: 148 [2023-12-21 05:42:52,307 INFO L226 Difference]: Without dead ends: 144 [2023-12-21 05:42:52,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2023-12-21 05:42:52,308 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 05:42:52,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 150 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 05:42:52,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-12-21 05:42:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2023-12-21 05:42:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 84 states have (on average 1.0714285714285714) internal successors, (90), 87 states have internal predecessors, (90), 37 states have call successors, (37), 23 states have call predecessors, (37), 22 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-21 05:42:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 160 transitions. [2023-12-21 05:42:52,352 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 160 transitions. Word has length 66 [2023-12-21 05:42:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:42:52,355 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 160 transitions. [2023-12-21 05:42:52,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2023-12-21 05:42:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 160 transitions. [2023-12-21 05:42:52,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-21 05:42:52,359 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:42:52,359 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:42:52,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-21 05:42:52,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:52,566 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:42:52,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:42:52,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2124427812, now seen corresponding path program 1 times [2023-12-21 05:42:52,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:42:52,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147365972] [2023-12-21 05:42:52,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:52,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:42:52,574 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:42:52,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1537310484] [2023-12-21 05:42:52,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:52,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:52,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:42:52,576 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:42:52,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-21 05:42:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:42:52,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-21 05:42:52,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:42:52,908 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 42 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-21 05:42:52,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:42:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 42 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-21 05:42:53,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:42:53,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147365972] [2023-12-21 05:42:53,114 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:42:53,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537310484] [2023-12-21 05:42:53,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537310484] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:42:53,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 05:42:53,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-12-21 05:42:53,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862305174] [2023-12-21 05:42:53,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 05:42:53,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-21 05:42:53,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:42:53,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-21 05:42:53,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-12-21 05:42:53,116 INFO L87 Difference]: Start difference. First operand 144 states and 160 transitions. Second operand has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2023-12-21 05:42:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:42:53,782 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2023-12-21 05:42:53,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 05:42:53,782 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) Word has length 71 [2023-12-21 05:42:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:42:53,784 INFO L225 Difference]: With dead ends: 163 [2023-12-21 05:42:53,784 INFO L226 Difference]: Without dead ends: 152 [2023-12-21 05:42:53,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2023-12-21 05:42:53,785 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 05:42:53,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 130 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 05:42:53,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-12-21 05:42:53,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2023-12-21 05:42:53,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 86 states have (on average 1.069767441860465) internal successors, (92), 90 states have internal predecessors, (92), 42 states have call successors, (42), 23 states have call predecessors, (42), 23 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-21 05:42:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 173 transitions. [2023-12-21 05:42:53,825 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 173 transitions. Word has length 71 [2023-12-21 05:42:53,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:42:53,826 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 173 transitions. [2023-12-21 05:42:53,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2023-12-21 05:42:53,826 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 173 transitions. [2023-12-21 05:42:53,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-21 05:42:53,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:42:53,827 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1] [2023-12-21 05:42:53,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-21 05:42:54,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-21 05:42:54,033 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:42:54,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:42:54,033 INFO L85 PathProgramCache]: Analyzing trace with hash -331345392, now seen corresponding path program 3 times [2023-12-21 05:42:54,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:42:54,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906710153] [2023-12-21 05:42:54,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:54,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:42:54,053 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:42:54,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1070210776] [2023-12-21 05:42:54,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 05:42:54,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:54,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:42:54,055 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:42:54,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-21 05:42:54,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 05:42:54,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 05:42:54,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-21 05:42:54,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:42:54,288 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 55 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-21 05:42:54,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:42:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 55 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-21 05:42:56,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:42:56,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906710153] [2023-12-21 05:42:56,314 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:42:56,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070210776] [2023-12-21 05:42:56,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070210776] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:42:56,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 05:42:56,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-12-21 05:42:56,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378724468] [2023-12-21 05:42:56,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 05:42:56,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 05:42:56,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:42:56,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 05:42:56,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-12-21 05:42:56,316 INFO L87 Difference]: Start difference. First operand 152 states and 173 transitions. Second operand has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2023-12-21 05:42:58,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:42:58,026 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2023-12-21 05:42:58,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 05:42:58,027 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) Word has length 78 [2023-12-21 05:42:58,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:42:58,028 INFO L225 Difference]: With dead ends: 158 [2023-12-21 05:42:58,028 INFO L226 Difference]: Without dead ends: 142 [2023-12-21 05:42:58,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2023-12-21 05:42:58,029 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 26 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-21 05:42:58,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 216 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-21 05:42:58,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-21 05:42:58,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2023-12-21 05:42:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 86 states have internal predecessors, (87), 34 states have call successors, (34), 22 states have call predecessors, (34), 22 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-21 05:42:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2023-12-21 05:42:58,066 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 78 [2023-12-21 05:42:58,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:42:58,067 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2023-12-21 05:42:58,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2023-12-21 05:42:58,067 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2023-12-21 05:42:58,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-21 05:42:58,068 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:42:58,068 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:42:58,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-21 05:42:58,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:58,268 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:42:58,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:42:58,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1753860344, now seen corresponding path program 2 times [2023-12-21 05:42:58,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:42:58,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948649907] [2023-12-21 05:42:58,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:58,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:42:58,285 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:42:58,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1432851669] [2023-12-21 05:42:58,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 05:42:58,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:58,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:42:58,286 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:42:58,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-21 05:42:58,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 05:42:58,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 05:42:58,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-21 05:42:58,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:42:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-12-21 05:42:58,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:42:58,638 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 05:42:58,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:42:58,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948649907] [2023-12-21 05:42:58,639 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:42:58,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432851669] [2023-12-21 05:42:58,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432851669] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:42:58,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 05:42:58,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-21 05:42:58,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011477317] [2023-12-21 05:42:58,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 05:42:58,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 05:42:58,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:42:58,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 05:42:58,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-12-21 05:42:58,641 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2023-12-21 05:42:58,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:42:58,980 INFO L93 Difference]: Finished difference Result 397 states and 421 transitions. [2023-12-21 05:42:58,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-21 05:42:58,981 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) Word has length 124 [2023-12-21 05:42:58,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:42:58,982 INFO L225 Difference]: With dead ends: 397 [2023-12-21 05:42:58,982 INFO L226 Difference]: Without dead ends: 381 [2023-12-21 05:42:58,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-12-21 05:42:58,983 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 131 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 05:42:58,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 132 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 05:42:58,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-12-21 05:42:59,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 325. [2023-12-21 05:42:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 201 states have (on average 1.0497512437810945) internal successors, (211), 208 states have internal predecessors, (211), 68 states have call successors, (68), 56 states have call predecessors, (68), 55 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2023-12-21 05:42:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 344 transitions. [2023-12-21 05:42:59,053 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 344 transitions. Word has length 124 [2023-12-21 05:42:59,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:42:59,054 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 344 transitions. [2023-12-21 05:42:59,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2023-12-21 05:42:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 344 transitions. [2023-12-21 05:42:59,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-21 05:42:59,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:42:59,055 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:42:59,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-21 05:42:59,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-21 05:42:59,261 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:42:59,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:42:59,261 INFO L85 PathProgramCache]: Analyzing trace with hash 109149613, now seen corresponding path program 1 times [2023-12-21 05:42:59,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:42:59,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110592785] [2023-12-21 05:42:59,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:59,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:42:59,276 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:42:59,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1913457916] [2023-12-21 05:42:59,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:42:59,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:59,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:42:59,278 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:42:59,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-21 05:42:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:42:59,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-21 05:42:59,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:42:59,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1106 backedges. 104 proven. 116 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2023-12-21 05:42:59,561 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:42:59,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:42:59,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110592785] [2023-12-21 05:42:59,736 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:42:59,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913457916] [2023-12-21 05:42:59,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913457916] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 05:42:59,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-21 05:42:59,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-12-21 05:42:59,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198505715] [2023-12-21 05:42:59,737 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-21 05:42:59,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 05:42:59,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:42:59,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 05:42:59,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-12-21 05:42:59,738 INFO L87 Difference]: Start difference. First operand 325 states and 344 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) [2023-12-21 05:43:00,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:43:00,063 INFO L93 Difference]: Finished difference Result 327 states and 345 transitions. [2023-12-21 05:43:00,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 05:43:00,063 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) Word has length 132 [2023-12-21 05:43:00,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:43:00,065 INFO L225 Difference]: With dead ends: 327 [2023-12-21 05:43:00,065 INFO L226 Difference]: Without dead ends: 311 [2023-12-21 05:43:00,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-12-21 05:43:00,066 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 11 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 05:43:00,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 274 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 05:43:00,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-12-21 05:43:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2023-12-21 05:43:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 193 states have (on average 1.0466321243523315) internal successors, (202), 200 states have internal predecessors, (202), 64 states have call successors, (64), 53 states have call predecessors, (64), 53 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2023-12-21 05:43:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 328 transitions. [2023-12-21 05:43:00,124 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 328 transitions. Word has length 132 [2023-12-21 05:43:00,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:43:00,124 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 328 transitions. [2023-12-21 05:43:00,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 5 states have call successors, (23) [2023-12-21 05:43:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 328 transitions. [2023-12-21 05:43:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 05:43:00,126 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:43:00,126 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:43:00,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-21 05:43:00,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-21 05:43:00,331 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:43:00,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:43:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash 460751474, now seen corresponding path program 2 times [2023-12-21 05:43:00,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:43:00,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129346028] [2023-12-21 05:43:00,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:43:00,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:43:00,340 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:43:00,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2026210811] [2023-12-21 05:43:00,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 05:43:00,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:43:00,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:43:00,342 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:43:00,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-21 05:43:00,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 05:43:00,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 05:43:00,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-21 05:43:00,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:43:00,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 128 proven. 84 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2023-12-21 05:43:00,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:43:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 128 proven. 76 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2023-12-21 05:43:01,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:43:01,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129346028] [2023-12-21 05:43:01,348 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:43:01,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026210811] [2023-12-21 05:43:01,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026210811] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:43:01,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 05:43:01,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2023-12-21 05:43:01,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012134378] [2023-12-21 05:43:01,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 05:43:01,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-21 05:43:01,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:43:01,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-21 05:43:01,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2023-12-21 05:43:01,353 INFO L87 Difference]: Start difference. First operand 311 states and 328 transitions. Second operand has 21 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 18 states have internal predecessors, (43), 13 states have call successors, (51), 3 states have call predecessors, (51), 2 states have return successors, (49), 11 states have call predecessors, (49), 13 states have call successors, (49) [2023-12-21 05:43:02,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:43:02,009 INFO L93 Difference]: Finished difference Result 329 states and 347 transitions. [2023-12-21 05:43:02,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 05:43:02,009 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 18 states have internal predecessors, (43), 13 states have call successors, (51), 3 states have call predecessors, (51), 2 states have return successors, (49), 11 states have call predecessors, (49), 13 states have call successors, (49) Word has length 155 [2023-12-21 05:43:02,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:43:02,011 INFO L225 Difference]: With dead ends: 329 [2023-12-21 05:43:02,011 INFO L226 Difference]: Without dead ends: 325 [2023-12-21 05:43:02,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2023-12-21 05:43:02,012 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 18 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 05:43:02,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 352 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 05:43:02,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-12-21 05:43:02,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 318. [2023-12-21 05:43:02,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 198 states have (on average 1.0404040404040404) internal successors, (206), 204 states have internal predecessors, (206), 65 states have call successors, (65), 55 states have call predecessors, (65), 54 states have return successors, (63), 58 states have call predecessors, (63), 63 states have call successors, (63) [2023-12-21 05:43:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 334 transitions. [2023-12-21 05:43:02,125 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 334 transitions. Word has length 155 [2023-12-21 05:43:02,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:43:02,125 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 334 transitions. [2023-12-21 05:43:02,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 18 states have internal predecessors, (43), 13 states have call successors, (51), 3 states have call predecessors, (51), 2 states have return successors, (49), 11 states have call predecessors, (49), 13 states have call successors, (49) [2023-12-21 05:43:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 334 transitions. [2023-12-21 05:43:02,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-21 05:43:02,126 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:43:02,126 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:43:02,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-21 05:43:02,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-21 05:43:02,327 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:43:02,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:43:02,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1264679123, now seen corresponding path program 2 times [2023-12-21 05:43:02,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:43:02,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133891726] [2023-12-21 05:43:02,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:43:02,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:43:02,338 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:43:02,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [321930259] [2023-12-21 05:43:02,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 05:43:02,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:43:02,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:43:02,340 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:43:02,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-21 05:43:02,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 05:43:02,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 05:43:02,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-21 05:43:02,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:43:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 204 proven. 88 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2023-12-21 05:43:03,186 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:43:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 204 proven. 88 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2023-12-21 05:43:30,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:43:30,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133891726] [2023-12-21 05:43:30,385 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:43:30,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321930259] [2023-12-21 05:43:30,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321930259] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:43:30,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 05:43:30,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2023-12-21 05:43:30,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562803447] [2023-12-21 05:43:30,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 05:43:30,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-21 05:43:30,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:43:30,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-21 05:43:30,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=357, Unknown=4, NotChecked=0, Total=462 [2023-12-21 05:43:30,387 INFO L87 Difference]: Start difference. First operand 318 states and 334 transitions. Second operand has 22 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 14 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) [2023-12-21 05:45:03,438 WARN L293 SmtUtils]: Spent 1.54m on a formula simplification that was a NOOP. DAG size: 134 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 05:45:04,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:45:16,619 WARN L293 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 05:45:18,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:45:44,087 WARN L293 SmtUtils]: Spent 23.50s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 05:45:49,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:46:24,171 WARN L293 SmtUtils]: Spent 32.60s on a formula simplification that was a NOOP. DAG size: 138 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 05:46:29,584 WARN L293 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 05:46:38,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:46:41,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:46:46,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:46:48,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:47:11,613 WARN L293 SmtUtils]: Spent 23.22s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 05:47:13,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:47:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:47:13,759 INFO L93 Difference]: Finished difference Result 339 states and 366 transitions. [2023-12-21 05:47:13,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-21 05:47:13,760 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 14 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) Word has length 160 [2023-12-21 05:47:13,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:47:13,761 INFO L225 Difference]: With dead ends: 339 [2023-12-21 05:47:13,762 INFO L226 Difference]: Without dead ends: 307 [2023-12-21 05:47:13,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 217.2s TimeCoverageRelationStatistics Valid=262, Invalid=790, Unknown=4, NotChecked=0, Total=1056 [2023-12-21 05:47:13,763 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 32 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 122 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.3s IncrementalHoareTripleChecker+Time [2023-12-21 05:47:13,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 403 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 489 Invalid, 3 Unknown, 0 Unchecked, 25.3s Time] [2023-12-21 05:47:13,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2023-12-21 05:47:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 306. [2023-12-21 05:47:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 191 states have (on average 1.0157068062827226) internal successors, (194), 193 states have internal predecessors, (194), 62 states have call successors, (62), 52 states have call predecessors, (62), 52 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2023-12-21 05:47:13,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 317 transitions. [2023-12-21 05:47:13,849 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 317 transitions. Word has length 160 [2023-12-21 05:47:13,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:47:13,850 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 317 transitions. [2023-12-21 05:47:13,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 14 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) [2023-12-21 05:47:13,850 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 317 transitions. [2023-12-21 05:47:13,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2023-12-21 05:47:13,851 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:47:13,852 INFO L195 NwaCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:47:13,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-21 05:47:14,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-21 05:47:14,061 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:47:14,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:47:14,061 INFO L85 PathProgramCache]: Analyzing trace with hash -141720852, now seen corresponding path program 3 times [2023-12-21 05:47:14,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:47:14,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909794513] [2023-12-21 05:47:14,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:47:14,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:47:14,071 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:47:14,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1647726620] [2023-12-21 05:47:14,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 05:47:14,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:47:14,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:47:14,073 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:47:14,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-21 05:47:14,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2023-12-21 05:47:14,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 05:47:14,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-21 05:47:14,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:47:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 300 proven. 4880 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2023-12-21 05:47:14,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:47:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2023-12-21 05:47:15,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:47:15,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909794513] [2023-12-21 05:47:15,062 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:47:15,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647726620] [2023-12-21 05:47:15,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647726620] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:47:15,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 05:47:15,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-12-21 05:47:15,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629507100] [2023-12-21 05:47:15,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 05:47:15,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 05:47:15,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:47:15,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 05:47:15,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2023-12-21 05:47:15,065 INFO L87 Difference]: Start difference. First operand 306 states and 317 transitions. Second operand has 24 states, 24 states have (on average 4.208333333333333) internal successors, (101), 24 states have internal predecessors, (101), 20 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 20 states have call predecessors, (102), 20 states have call successors, (102) [2023-12-21 05:47:16,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:47:16,023 INFO L93 Difference]: Finished difference Result 756 states and 782 transitions. [2023-12-21 05:47:16,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-21 05:47:16,023 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.208333333333333) internal successors, (101), 24 states have internal predecessors, (101), 20 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 20 states have call predecessors, (102), 20 states have call successors, (102) Word has length 292 [2023-12-21 05:47:16,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:47:16,026 INFO L225 Difference]: With dead ends: 756 [2023-12-21 05:47:16,026 INFO L226 Difference]: Without dead ends: 724 [2023-12-21 05:47:16,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 558 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2023-12-21 05:47:16,028 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 222 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 05:47:16,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 185 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 05:47:16,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2023-12-21 05:47:16,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 602. [2023-12-21 05:47:16,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 378 states have (on average 1.0317460317460319) internal successors, (390), 388 states have internal predecessors, (390), 119 states have call successors, (119), 105 states have call predecessors, (119), 104 states have return successors, (117), 108 states have call predecessors, (117), 117 states have call successors, (117) [2023-12-21 05:47:16,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 626 transitions. [2023-12-21 05:47:16,209 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 626 transitions. Word has length 292 [2023-12-21 05:47:16,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:47:16,209 INFO L495 AbstractCegarLoop]: Abstraction has 602 states and 626 transitions. [2023-12-21 05:47:16,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.208333333333333) internal successors, (101), 24 states have internal predecessors, (101), 20 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 20 states have call predecessors, (102), 20 states have call successors, (102) [2023-12-21 05:47:16,209 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 626 transitions. [2023-12-21 05:47:16,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2023-12-21 05:47:16,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:47:16,211 INFO L195 NwaCegarLoop]: trace histogram [59, 58, 58, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:47:16,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-21 05:47:16,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:47:16,418 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:47:16,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:47:16,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1483186871, now seen corresponding path program 3 times [2023-12-21 05:47:16,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:47:16,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125455887] [2023-12-21 05:47:16,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:47:16,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:47:16,428 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:47:16,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [712045280] [2023-12-21 05:47:16,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 05:47:16,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:47:16,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:47:16,430 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:47:16,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-21 05:47:16,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-21 05:47:16,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 05:47:16,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-21 05:47:16,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:48:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7168 backedges. 1137 proven. 75 refuted. 0 times theorem prover too weak. 5956 trivial. 0 not checked. [2023-12-21 05:48:03,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:48:59,325 WARN L293 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 05:49:07,827 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 05:49:20,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7168 backedges. 957 proven. 52 refuted. 0 times theorem prover too weak. 6159 trivial. 0 not checked. [2023-12-21 05:49:20,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:49:20,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125455887] [2023-12-21 05:49:20,981 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:49:20,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712045280] [2023-12-21 05:49:20,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712045280] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:49:20,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 05:49:20,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2023-12-21 05:49:20,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219987462] [2023-12-21 05:49:20,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 05:49:20,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-21 05:49:20,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:49:20,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-21 05:49:20,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=323, Unknown=10, NotChecked=0, Total=420 [2023-12-21 05:49:20,983 INFO L87 Difference]: Start difference. First operand 602 states and 626 transitions. Second operand has 21 states, 16 states have (on average 2.0) internal successors, (32), 13 states have internal predecessors, (32), 13 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (34), 12 states have call predecessors, (34), 11 states have call successors, (34) [2023-12-21 05:49:52,321 WARN L293 SmtUtils]: Spent 30.06s on a formula simplification. DAG size of input: 96 DAG size of output: 101 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 05:50:03,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-21 05:50:07,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-21 05:50:12,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-21 05:50:16,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-21 05:50:20,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:50:24,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:50:28,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-21 05:50:32,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:50:36,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:50:40,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:50:44,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:51:07,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:51:11,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:51:15,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.74s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-21 05:51:20,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:51:24,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:51:26,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-21 05:51:30,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:52:07,822 WARN L293 SmtUtils]: Spent 28.24s on a formula simplification. DAG size of input: 85 DAG size of output: 79 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 05:52:18,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:52:22,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:52:32,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:52:36,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:52:43,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:52:48,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:52:48,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:52:48,520 INFO L93 Difference]: Finished difference Result 612 states and 634 transitions. [2023-12-21 05:52:48,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 05:52:48,521 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 2.0) internal successors, (32), 13 states have internal predecessors, (32), 13 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (34), 12 states have call predecessors, (34), 11 states have call successors, (34) Word has length 328 [2023-12-21 05:52:48,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:52:48,523 INFO L225 Difference]: With dead ends: 612 [2023-12-21 05:52:48,523 INFO L226 Difference]: Without dead ends: 569 [2023-12-21 05:52:48,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 635 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 163.0s TimeCoverageRelationStatistics Valid=158, Invalid=529, Unknown=15, NotChecked=0, Total=702 [2023-12-21 05:52:48,524 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 49 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 103.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 103.7s IncrementalHoareTripleChecker+Time [2023-12-21 05:52:48,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 227 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 162 Invalid, 24 Unknown, 0 Unchecked, 103.7s Time] [2023-12-21 05:52:48,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2023-12-21 05:52:48,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2023-12-21 05:52:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 366 states have (on average 1.0027322404371584) internal successors, (367), 366 states have internal predecessors, (367), 102 states have call successors, (102), 101 states have call predecessors, (102), 100 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) [2023-12-21 05:52:48,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 570 transitions. [2023-12-21 05:52:48,725 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 570 transitions. Word has length 328 [2023-12-21 05:52:48,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:52:48,726 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 570 transitions. [2023-12-21 05:52:48,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 2.0) internal successors, (32), 13 states have internal predecessors, (32), 13 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (34), 12 states have call predecessors, (34), 11 states have call successors, (34) [2023-12-21 05:52:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 570 transitions. [2023-12-21 05:52:48,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2023-12-21 05:52:48,730 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:52:48,730 INFO L195 NwaCegarLoop]: trace histogram [102, 101, 101, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:52:48,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-21 05:52:48,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-21 05:52:48,931 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:52:48,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:52:48,931 INFO L85 PathProgramCache]: Analyzing trace with hash -596086424, now seen corresponding path program 4 times [2023-12-21 05:52:48,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:52:48,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536163222] [2023-12-21 05:52:48,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:52:48,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:52:48,967 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:52:48,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [847185757] [2023-12-21 05:52:48,968 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 05:52:48,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:52:48,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:52:48,969 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:52:48,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-21 05:52:49,251 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 05:52:49,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-21 05:52:49,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 05:52:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 05:52:49,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 05:52:49,482 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 05:52:49,483 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 05:52:49,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-12-21 05:52:49,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:52:49,696 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:52:49,701 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 05:52:49,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 05:52:49 BoogieIcfgContainer [2023-12-21 05:52:49,831 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 05:52:49,832 INFO L158 Benchmark]: Toolchain (without parser) took 609679.01ms. Allocated memory was 192.9MB in the beginning and 253.8MB in the end (delta: 60.8MB). Free memory was 147.4MB in the beginning and 154.7MB in the end (delta: -7.3MB). Peak memory consumption was 53.9MB. Max. memory is 8.0GB. [2023-12-21 05:52:49,832 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 05:52:49,832 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.14ms. Allocated memory is still 192.9MB. Free memory was 147.0MB in the beginning and 135.8MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 05:52:49,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.67ms. Allocated memory is still 192.9MB. Free memory was 135.8MB in the beginning and 134.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 05:52:49,835 INFO L158 Benchmark]: Boogie Preprocessor took 25.87ms. Allocated memory is still 192.9MB. Free memory was 134.1MB in the beginning and 132.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 05:52:49,835 INFO L158 Benchmark]: RCFGBuilder took 265.90ms. Allocated memory is still 192.9MB. Free memory was 132.3MB in the beginning and 120.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-21 05:52:49,835 INFO L158 Benchmark]: TraceAbstraction took 609107.63ms. Allocated memory was 192.9MB in the beginning and 253.8MB in the end (delta: 60.8MB). Free memory was 119.5MB in the beginning and 154.7MB in the end (delta: -35.2MB). Peak memory consumption was 26.7MB. Max. memory is 8.0GB. [2023-12-21 05:52:49,841 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 192.9MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.14ms. Allocated memory is still 192.9MB. Free memory was 147.0MB in the beginning and 135.8MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.67ms. Allocated memory is still 192.9MB. Free memory was 135.8MB in the beginning and 134.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.87ms. Allocated memory is still 192.9MB. Free memory was 134.1MB in the beginning and 132.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 265.90ms. Allocated memory is still 192.9MB. Free memory was 132.3MB in the beginning and 120.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 609107.63ms. Allocated memory was 192.9MB in the beginning and 253.8MB in the end (delta: 60.8MB). Free memory was 119.5MB in the beginning and 154.7MB in the end (delta: -35.2MB). Peak memory consumption was 26.7MB. 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [a=20, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=11, n=11, x=1331, y=397, z=72] [L33] EXPR counter++ VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=12, n=12, x=1728, y=469, z=78] [L33] EXPR counter++ VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=13, n=13, x=2197, y=547, z=84] [L33] EXPR counter++ VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=14, n=14, x=2744, y=631, z=90] [L33] EXPR counter++ VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=15, n=15, x=3375, y=721, z=96] [L33] EXPR counter++ VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=16, n=16, x=4096, y=817, z=102] [L33] EXPR counter++ VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=17, n=17, x=4913, y=919, z=108] [L33] EXPR counter++ VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=18, n=18, x=5832, y=1027, z=114] [L33] EXPR counter++ VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=19, n=19, x=6859, y=1141, z=120] [L33] EXPR counter++ VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=20, n=20, x=8000, y=1261, z=126] [L33] EXPR counter++ VAL [a=20, counter=21, n=20, x=8000, y=1261, z=126] [L33] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=20, counter=21, n=20, x=8000, y=1261, z=126] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, counter=21] [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L17] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 608.9s, OverallIterations: 19, TraceHistogramMax: 102, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 442.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 28 mSolverCounterUnknown, 785 SdHoareTripleChecker+Valid, 137.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 667 mSDsluCounter, 2916 SdHoareTripleChecker+Invalid, 137.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2422 mSDsCounter, 697 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3509 IncrementalHoareTripleChecker+Invalid, 4234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 697 mSolverCounterUnsat, 494 mSDtfsCounter, 3509 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3144 GetRequests, 2845 SyntacticMatches, 5 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 384.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=602occurred in iteration=17, InterpolantAutomatonStates: 229, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 204 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 159.9s InterpolantComputationTime, 2189 NumberOfCodeBlocks, 1837 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 3050 ConstructedInterpolants, 1 QuantifiedInterpolants, 17178 SizeOfPredicates, 65 NumberOfNonLiveVariables, 3054 ConjunctsInSsa, 436 ConjunctsInUnsatCore, 32 InterpolantComputations, 3 PerfectInterpolantSequences, 30513/37410 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 RESULT: Ultimate proved your program to be incorrect! [2023-12-21 05:52:49,929 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...