/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/ps4-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 08:11:22,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 08:11:22,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 08:11:22,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 08:11:22,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 08:11:22,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 08:11:22,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 08:11:22,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 08:11:22,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 08:11:22,704 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 08:11:22,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 08:11:22,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 08:11:22,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 08:11:22,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 08:11:22,706 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 08:11:22,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 08:11:22,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 08:11:22,706 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 08:11:22,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 08:11:22,708 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 08:11:22,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 08:11:22,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 08:11:22,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 08:11:22,708 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 08:11:22,708 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 08:11:22,709 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 08:11:22,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 08:11:22,709 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 08:11:22,709 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 08:11:22,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 08:11:22,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 08:11:22,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 08:11:22,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 08:11:22,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 08:11:22,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 08:11:22,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 08:11:22,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 08:11:22,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 08:11:22,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 08:11:22,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 08:11:22,711 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 08:11:22,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 08:11:22,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 08:11:22,712 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 08:11:22,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 08:11:22,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 08:11:22,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 08:11:22,911 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 08:11:22,911 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 08:11:22,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound20.c [2023-12-21 08:11:23,990 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 08:11:24,124 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 08:11:24,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound20.c [2023-12-21 08:11:24,130 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/673119110/b18f2c418bae47dea19bfd5f4aac2edc/FLAGccfce7da6 [2023-12-21 08:11:24,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/673119110/b18f2c418bae47dea19bfd5f4aac2edc [2023-12-21 08:11:24,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 08:11:24,144 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 08:11:24,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 08:11:24,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 08:11:24,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 08:11:24,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:11:24" (1/1) ... [2023-12-21 08:11:24,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e33f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:11:24, skipping insertion in model container [2023-12-21 08:11:24,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:11:24" (1/1) ... [2023-12-21 08:11:24,166 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 08:11:24,267 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/ps4-ll_unwindbound20.c[458,471] [2023-12-21 08:11:24,285 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 08:11:24,299 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 08:11:24,309 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/ps4-ll_unwindbound20.c[458,471] [2023-12-21 08:11:24,327 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 08:11:24,349 INFO L206 MainTranslator]: Completed translation [2023-12-21 08:11:24,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:11:24 WrapperNode [2023-12-21 08:11:24,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 08:11:24,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 08:11:24,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 08:11:24,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 08:11:24,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:11:24" (1/1) ... [2023-12-21 08:11:24,370 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:11:24" (1/1) ... [2023-12-21 08:11:24,391 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2023-12-21 08:11:24,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 08:11:24,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 08:11:24,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 08:11:24,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 08:11:24,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:11:24" (1/1) ... [2023-12-21 08:11:24,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:11:24" (1/1) ... [2023-12-21 08:11:24,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:11:24" (1/1) ... [2023-12-21 08:11:24,415 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-21 08:11:24,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:11:24" (1/1) ... [2023-12-21 08:11:24,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:11:24" (1/1) ... [2023-12-21 08:11:24,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:11:24" (1/1) ... [2023-12-21 08:11:24,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:11:24" (1/1) ... [2023-12-21 08:11:24,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:11:24" (1/1) ... [2023-12-21 08:11:24,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:11:24" (1/1) ... [2023-12-21 08:11:24,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 08:11:24,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 08:11:24,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 08:11:24,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 08:11:24,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:11:24" (1/1) ... [2023-12-21 08:11:24,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 08:11:24,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:11:24,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 08:11:24,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 08:11:24,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 08:11:24,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 08:11:24,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 08:11:24,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 08:11:24,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-21 08:11:24,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-21 08:11:24,541 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 08:11:24,543 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 08:11:24,670 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 08:11:24,691 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 08:11:24,692 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 08:11:24,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:11:24 BoogieIcfgContainer [2023-12-21 08:11:24,692 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 08:11:24,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 08:11:24,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 08:11:24,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 08:11:24,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 08:11:24" (1/3) ... [2023-12-21 08:11:24,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc624cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:11:24, skipping insertion in model container [2023-12-21 08:11:24,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:11:24" (2/3) ... [2023-12-21 08:11:24,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc624cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:11:24, skipping insertion in model container [2023-12-21 08:11:24,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:11:24" (3/3) ... [2023-12-21 08:11:24,699 INFO L112 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound20.c [2023-12-21 08:11:24,710 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 08:11:24,710 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 08:11:24,745 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 08:11:24,750 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;@1b94b8bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 08:11:24,750 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 08:11:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 08:11:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-21 08:11:24,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:11:24,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-21 08:11:24,759 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:11:24,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:11:24,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2070802916, now seen corresponding path program 1 times [2023-12-21 08:11:24,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:11:24,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065151618] [2023-12-21 08:11:24,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:11:24,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:11:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 08:11:24,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:11:24,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065151618] [2023-12-21 08:11:24,855 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-21 08:11:24,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179352679] [2023-12-21 08:11:24,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:11:24,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:11:24,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:11:24,858 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 08:11:24,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 08:11:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 08:11:24,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 08:11:24,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:11:24,925 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 08:11:24,925 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 08:11:24,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179352679] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 08:11:24,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 08:11:24,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 08:11:24,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071725503] [2023-12-21 08:11:24,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 08:11:24,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 08:11:24,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:11:24,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 08:11:24,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 08:11:24,949 INFO L87 Difference]: Start difference. First operand has 15 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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 08:11:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:11:24,963 INFO L93 Difference]: Finished difference Result 29 states and 42 transitions. [2023-12-21 08:11:24,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 08:11:24,965 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 08:11:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:11:24,969 INFO L225 Difference]: With dead ends: 29 [2023-12-21 08:11:24,969 INFO L226 Difference]: Without dead ends: 13 [2023-12-21 08:11:24,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 08:11:24,972 INFO L413 NwaCegarLoop]: 16 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, 16 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 08:11:24,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 08:11:24,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-21 08:11:24,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-21 08:11:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 08:11:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2023-12-21 08:11:24,992 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 6 [2023-12-21 08:11:24,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:11:24,992 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2023-12-21 08:11:24,992 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 08:11:24,993 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2023-12-21 08:11:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-21 08:11:24,993 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:11:24,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-21 08:11:24,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-21 08:11:25,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-21 08:11:25,199 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:11:25,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:11:25,199 INFO L85 PathProgramCache]: Analyzing trace with hash -170804699, now seen corresponding path program 1 times [2023-12-21 08:11:25,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:11:25,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619559880] [2023-12-21 08:11:25,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:11:25,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:11:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 08:11:25,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:11:25,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619559880] [2023-12-21 08:11:25,244 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-21 08:11:25,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405245410] [2023-12-21 08:11:25,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:11:25,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:11:25,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:11:25,245 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 08:11:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 08:11:25,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 08:11:25,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 08:11:25,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:11:25,316 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 08:11:25,316 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 08:11:25,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405245410] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 08:11:25,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 08:11:25,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 08:11:25,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139854058] [2023-12-21 08:11:25,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 08:11:25,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 08:11:25,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:11:25,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 08:11:25,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 08:11:25,318 INFO L87 Difference]: Start difference. First operand 13 states and 16 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 08:11:25,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:11:25,328 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2023-12-21 08:11:25,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 08:11:25,328 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 08:11:25,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:11:25,329 INFO L225 Difference]: With dead ends: 23 [2023-12-21 08:11:25,329 INFO L226 Difference]: Without dead ends: 15 [2023-12-21 08:11:25,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 08:11:25,330 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 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 08:11:25,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 08:11:25,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-21 08:11:25,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-21 08:11:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 08:11:25,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-12-21 08:11:25,333 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 7 [2023-12-21 08:11:25,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:11:25,334 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-12-21 08:11:25,334 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 08:11:25,334 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-12-21 08:11:25,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-21 08:11:25,334 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:11:25,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-21 08:11:25,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 08:11:25,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-21 08:11:25,539 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:11:25,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:11:25,540 INFO L85 PathProgramCache]: Analyzing trace with hash -169017239, now seen corresponding path program 1 times [2023-12-21 08:11:25,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:11:25,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142352636] [2023-12-21 08:11:25,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:11:25,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:11:25,550 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 08:11:25,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [903446063] [2023-12-21 08:11:25,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:11:25,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:11:25,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:11:25,556 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 08:11:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 08:11:25,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 08:11:25,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:11:25,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 08:11:25,627 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 08:11:25,628 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 08:11:25,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:11:25,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142352636] [2023-12-21 08:11:25,628 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 08:11:25,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903446063] [2023-12-21 08:11:25,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903446063] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 08:11:25,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 08:11:25,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 08:11:25,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521692935] [2023-12-21 08:11:25,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 08:11:25,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 08:11:25,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:11:25,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 08:11:25,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 08:11:25,629 INFO L87 Difference]: Start difference. First operand 15 states and 18 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 08:11:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:11:25,659 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2023-12-21 08:11:25,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 08:11:25,659 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 08:11:25,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:11:25,660 INFO L225 Difference]: With dead ends: 25 [2023-12-21 08:11:25,660 INFO L226 Difference]: Without dead ends: 21 [2023-12-21 08:11:25,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 08:11:25,661 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 08:11:25,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 08:11:25,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-21 08:11:25,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-21 08:11:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 08:11:25,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-12-21 08:11:25,665 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 7 [2023-12-21 08:11:25,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:11:25,665 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-12-21 08:11:25,666 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 08:11:25,666 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-12-21 08:11:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 08:11:25,666 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:11:25,666 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 08:11:25,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 08:11:25,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:11:25,871 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:11:25,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:11:25,871 INFO L85 PathProgramCache]: Analyzing trace with hash 867499275, now seen corresponding path program 1 times [2023-12-21 08:11:25,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:11:25,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602778120] [2023-12-21 08:11:25,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:11:25,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:11:25,882 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 08:11:25,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1377475277] [2023-12-21 08:11:25,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:11:25,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:11:25,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:11:25,886 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 08:11:25,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-21 08:11:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 08:11:25,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 08:11:25,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:11:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 08:11:25,992 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 08:11:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 08:11:26,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:11:26,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602778120] [2023-12-21 08:11:26,038 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 08:11:26,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377475277] [2023-12-21 08:11:26,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377475277] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 08:11:26,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 08:11:26,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-21 08:11:26,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868651666] [2023-12-21 08:11:26,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 08:11:26,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 08:11:26,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:11:26,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 08:11:26,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-21 08:11:26,041 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 08:11:26,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:11:26,092 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2023-12-21 08:11:26,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 08:11:26,093 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2023-12-21 08:11:26,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:11:26,093 INFO L225 Difference]: With dead ends: 55 [2023-12-21 08:11:26,094 INFO L226 Difference]: Without dead ends: 47 [2023-12-21 08:11:26,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 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 08:11:26,095 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 08:11:26,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 69 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 08:11:26,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-21 08:11:26,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2023-12-21 08:11:26,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.25) internal successors, (35), 31 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-21 08:11:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2023-12-21 08:11:26,101 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 15 [2023-12-21 08:11:26,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:11:26,101 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2023-12-21 08:11:26,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 08:11:26,102 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2023-12-21 08:11:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 08:11:26,102 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:11:26,102 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 08:11:26,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-21 08:11:26,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:11:26,309 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:11:26,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:11:26,309 INFO L85 PathProgramCache]: Analyzing trace with hash 869286735, now seen corresponding path program 1 times [2023-12-21 08:11:26,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:11:26,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146750075] [2023-12-21 08:11:26,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:11:26,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:11:26,316 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 08:11:26,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [327552348] [2023-12-21 08:11:26,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:11:26,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:11:26,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:11:26,317 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 08:11:26,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-21 08:11:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 08:11:26,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-21 08:11:26,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:11:26,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 08:11:26,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 08:11:26,555 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 08:11:26,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:11:26,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146750075] [2023-12-21 08:11:26,556 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 08:11:26,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327552348] [2023-12-21 08:11:26,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327552348] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 08:11:26,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 08:11:26,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2023-12-21 08:11:26,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383369189] [2023-12-21 08:11:26,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 08:11:26,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 08:11:26,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:11:26,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 08:11:26,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-21 08:11:26,557 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 08:11:26,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:11:26,618 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2023-12-21 08:11:26,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 08:11:26,619 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 15 [2023-12-21 08:11:26,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:11:26,619 INFO L225 Difference]: With dead ends: 57 [2023-12-21 08:11:26,619 INFO L226 Difference]: Without dead ends: 46 [2023-12-21 08:11:26,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-12-21 08:11:26,620 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 08:11:26,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 69 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 08:11:26,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-21 08:11:26,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2023-12-21 08:11:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 08:11:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2023-12-21 08:11:26,627 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 15 [2023-12-21 08:11:26,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:11:26,628 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2023-12-21 08:11:26,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 08:11:26,628 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2023-12-21 08:11:26,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-21 08:11:26,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:11:26,628 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-21 08:11:26,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-21 08:11:26,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:11:26,833 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:11:26,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:11:26,834 INFO L85 PathProgramCache]: Analyzing trace with hash 24753612, now seen corresponding path program 1 times [2023-12-21 08:11:26,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:11:26,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748521830] [2023-12-21 08:11:26,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:11:26,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:11:26,857 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 08:11:26,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1456219822] [2023-12-21 08:11:26,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:11:26,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:11:26,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:11:26,860 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 08:11:26,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-21 08:11:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 08:11:26,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-21 08:11:26,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:11:27,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 08:11:27,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 08:11:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 08:11:27,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:11:27,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748521830] [2023-12-21 08:11:27,242 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 08:11:27,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456219822] [2023-12-21 08:11:27,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456219822] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 08:11:27,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 08:11:27,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-12-21 08:11:27,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045734899] [2023-12-21 08:11:27,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 08:11:27,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 08:11:27,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:11:27,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 08:11:27,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-12-21 08:11:27,244 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 08:11:32,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 08:11:32,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:11:32,284 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2023-12-21 08:11:32,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-21 08:11:32,285 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2023-12-21 08:11:32,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:11:32,285 INFO L225 Difference]: With dead ends: 49 [2023-12-21 08:11:32,285 INFO L226 Difference]: Without dead ends: 42 [2023-12-21 08:11:32,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2023-12-21 08:11:32,286 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-21 08:11:32,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 101 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2023-12-21 08:11:32,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-21 08:11:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-21 08:11:32,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 08:11:32,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2023-12-21 08:11:32,293 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 21 [2023-12-21 08:11:32,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:11:32,293 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2023-12-21 08:11:32,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 08:11:32,293 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2023-12-21 08:11:32,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-21 08:11:32,293 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:11:32,294 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2023-12-21 08:11:32,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-21 08:11:32,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:11:32,495 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:11:32,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:11:32,495 INFO L85 PathProgramCache]: Analyzing trace with hash -795795011, now seen corresponding path program 2 times [2023-12-21 08:11:32,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:11:32,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43657413] [2023-12-21 08:11:32,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:11:32,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:11:32,502 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 08:11:32,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1338168515] [2023-12-21 08:11:32,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 08:11:32,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:11:32,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:11:32,503 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 08:11:32,534 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 08:11:32,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 08:11:32,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 08:11:32,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-21 08:11:32,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:11:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 08:11:32,605 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 08:11:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-21 08:11:32,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:11:32,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43657413] [2023-12-21 08:11:32,678 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 08:11:32,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338168515] [2023-12-21 08:11:32,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338168515] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 08:11:32,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 08:11:32,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-21 08:11:32,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902462354] [2023-12-21 08:11:32,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 08:11:32,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 08:11:32,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:11:32,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 08:11:32,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-12-21 08:11:32,679 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 08:11:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:11:32,800 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2023-12-21 08:11:32,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-21 08:11:32,801 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 39 [2023-12-21 08:11:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:11:32,802 INFO L225 Difference]: With dead ends: 118 [2023-12-21 08:11:32,802 INFO L226 Difference]: Without dead ends: 113 [2023-12-21 08:11:32,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 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 08:11:32,802 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 85 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 08:11:32,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 86 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 08:11:32,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-21 08:11:32,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 88. [2023-12-21 08:11:32,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.106060606060606) internal successors, (73), 66 states have internal predecessors, (73), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-21 08:11:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-12-21 08:11:32,813 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 39 [2023-12-21 08:11:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:11:32,813 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-12-21 08:11:32,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 08:11:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-12-21 08:11:32,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-21 08:11:32,814 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:11:32,814 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2023-12-21 08:11:32,821 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 08:11:33,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:11:33,019 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:11:33,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:11:33,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1312813826, now seen corresponding path program 2 times [2023-12-21 08:11:33,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:11:33,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444856505] [2023-12-21 08:11:33,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:11:33,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:11:33,026 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 08:11:33,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [788399691] [2023-12-21 08:11:33,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 08:11:33,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:11:33,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:11:33,027 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 08:11:33,055 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 08:11:33,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 08:11:33,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 08:11:33,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-21 08:11:33,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:11:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 47 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-21 08:11:33,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 08:11:41,367 WARN L854 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 3) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 3)) 4) 0)) (= (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 2)) (+ (* |c_ULTIMATE.start_main_~c~0#1| 2) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|)))) is different from false [2023-12-21 08:11:49,393 WARN L293 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:11:57,399 WARN L293 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:12:09,413 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:12:17,429 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| Int) (|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_12| Int)) (or (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|)) (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_12|) (* |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_12| 2))) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| 3) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| 3)) 4) 0)))) is different from true [2023-12-21 08:12:29,447 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:12:45,467 WARN L293 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:12:53,476 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| Int) (|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_12| Int)) (or (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|)) (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_12|) (* |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_12| 2))) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| 3) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| 3)) 4) 0))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-12-21 08:13:09,509 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| 3) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 3))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 3) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 3)) 4) 0))) is different from false [2023-12-21 08:13:29,552 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~c~0#1| 4)) (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 4))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 3) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 3)) 4) 0))) is different from false [2023-12-21 08:13:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 6 refuted. 6 times theorem prover too weak. 28 trivial. 35 not checked. [2023-12-21 08:13:41,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:13:41,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444856505] [2023-12-21 08:13:41,583 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 08:13:41,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788399691] [2023-12-21 08:13:41,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788399691] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 08:13:41,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 08:13:41,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-12-21 08:13:41,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308059481] [2023-12-21 08:13:41,583 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 08:13:41,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-21 08:13:41,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:13:41,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-21 08:13:41,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=230, Unknown=5, NotChecked=170, Total=462 [2023-12-21 08:13:41,584 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 22 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-21 08:13:41,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:13:41,822 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2023-12-21 08:13:41,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-21 08:13:41,822 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 45 [2023-12-21 08:13:41,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:13:41,823 INFO L225 Difference]: With dead ends: 94 [2023-12-21 08:13:41,823 INFO L226 Difference]: Without dead ends: 88 [2023-12-21 08:13:41,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=123, Invalid=542, Unknown=5, NotChecked=260, Total=930 [2023-12-21 08:13:41,824 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 08:13:41,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 185 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 140 Invalid, 0 Unknown, 170 Unchecked, 0.1s Time] [2023-12-21 08:13:41,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-21 08:13:41,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-12-21 08:13:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-21 08:13:41,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2023-12-21 08:13:41,839 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 45 [2023-12-21 08:13:41,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:13:41,840 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2023-12-21 08:13:41,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-21 08:13:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2023-12-21 08:13:41,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-21 08:13:41,845 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:13:41,845 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2023-12-21 08:13:41,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-21 08:13:42,050 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,SelfDestructingSolverStorable7 [2023-12-21 08:13:42,050 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:13:42,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:13:42,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1242040609, now seen corresponding path program 3 times [2023-12-21 08:13:42,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:13:42,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568453543] [2023-12-21 08:13:42,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:13:42,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:13:42,075 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 08:13:42,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392113303] [2023-12-21 08:13:42,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 08:13:42,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:13:42,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:13:42,081 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 08:13:42,083 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 08:13:42,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-12-21 08:13:42,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 08:13:42,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-21 08:13:42,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:13:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 08:13:42,353 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 08:13:42,594 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-21 08:13:42,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:13:42,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568453543] [2023-12-21 08:13:42,594 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 08:13:42,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392113303] [2023-12-21 08:13:42,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392113303] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 08:13:42,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 08:13:42,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-12-21 08:13:42,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633338665] [2023-12-21 08:13:42,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 08:13:42,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 08:13:42,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:13:42,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 08:13:42,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2023-12-21 08:13:42,600 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand has 24 states, 24 states have (on average 4.125) internal successors, (99), 24 states have internal predecessors, (99), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2023-12-21 08:13:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:13:42,857 INFO L93 Difference]: Finished difference Result 173 states and 182 transitions. [2023-12-21 08:13:42,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-21 08:13:42,858 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.125) internal successors, (99), 24 states have internal predecessors, (99), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 87 [2023-12-21 08:13:42,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:13:42,860 INFO L225 Difference]: With dead ends: 173 [2023-12-21 08:13:42,860 INFO L226 Difference]: Without dead ends: 168 [2023-12-21 08:13:42,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 148 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 08:13:42,863 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 08:13:42,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 121 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 08:13:42,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-12-21 08:13:42,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2023-12-21 08:13:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 126 states have (on average 1.007936507936508) internal successors, (127), 126 states have internal predecessors, (127), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-21 08:13:42,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2023-12-21 08:13:42,897 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 87 [2023-12-21 08:13:42,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:13:42,899 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2023-12-21 08:13:42,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.125) internal successors, (99), 24 states have internal predecessors, (99), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2023-12-21 08:13:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2023-12-21 08:13:42,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-21 08:13:42,904 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:13:42,904 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2023-12-21 08:13:42,926 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 08:13:43,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:13:43,130 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:13:43,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:13:43,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1310523363, now seen corresponding path program 4 times [2023-12-21 08:13:43,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:13:43,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205049056] [2023-12-21 08:13:43,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:13:43,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:13:43,142 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 08:13:43,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1011068927] [2023-12-21 08:13:43,142 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 08:13:43,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:13:43,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:13:43,164 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 08:13:43,192 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 08:13:43,836 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 08:13:43,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-21 08:13:43,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 08:13:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 08:13:44,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 08:13:44,981 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 08:13:44,981 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 08:13:44,991 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 08:13:45,191 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,SelfDestructingSolverStorable9 [2023-12-21 08:13:45,193 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2023-12-21 08:13:45,198 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 08:13:45,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 08:13:45 BoogieIcfgContainer [2023-12-21 08:13:45,276 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 08:13:45,276 INFO L158 Benchmark]: Toolchain (without parser) took 141132.67ms. Allocated memory is still 237.0MB. Free memory was 194.9MB in the beginning and 110.6MB in the end (delta: 84.3MB). Peak memory consumption was 85.7MB. Max. memory is 8.0GB. [2023-12-21 08:13:45,277 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 197.1MB. Free memory is still 148.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 08:13:45,277 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.97ms. Allocated memory is still 237.0MB. Free memory was 194.9MB in the beginning and 183.6MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 08:13:45,277 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.13ms. Allocated memory is still 237.0MB. Free memory was 183.6MB in the beginning and 182.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 08:13:45,277 INFO L158 Benchmark]: Boogie Preprocessor took 28.58ms. Allocated memory is still 237.0MB. Free memory was 182.1MB in the beginning and 180.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 08:13:45,277 INFO L158 Benchmark]: RCFGBuilder took 270.86ms. Allocated memory is still 237.0MB. Free memory was 180.5MB in the beginning and 169.7MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-21 08:13:45,278 INFO L158 Benchmark]: TraceAbstraction took 140582.91ms. Allocated memory is still 237.0MB. Free memory was 169.2MB in the beginning and 110.6MB in the end (delta: 58.7MB). Peak memory consumption was 59.5MB. Max. memory is 8.0GB. [2023-12-21 08:13:45,278 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.39ms. Allocated memory is still 197.1MB. Free memory is still 148.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.97ms. Allocated memory is still 237.0MB. Free memory was 194.9MB in the beginning and 183.6MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.13ms. Allocated memory is still 237.0MB. Free memory was 183.6MB in the beginning and 182.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.58ms. Allocated memory is still 237.0MB. Free memory was 182.1MB in the beginning and 180.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 270.86ms. Allocated memory is still 237.0MB. Free memory was 180.5MB in the beginning and 169.7MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 140582.91ms. Allocated memory is still 237.0MB. Free memory was 169.2MB in the beginning and 110.6MB in the end (delta: 58.7MB). Peak memory consumption was 59.5MB. 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: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int counter = 0; [L19] short k; [L20] long long y, x, c; [L21] k = __VERIFIER_nondet_short() [L23] y = 0 [L24] x = 0 [L25] c = 0 VAL [c=0, counter=0, k=22, x=0, y=0] [L27] EXPR counter++ VAL [c=0, counter=1, k=22, x=0, y=0] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=1] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=0, counter=1, k=22, x=0, y=0] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=1, counter=1, k=22, x=1, y=1] [L27] EXPR counter++ VAL [c=1, counter=2, k=22, x=1, y=1] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=2] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=1, counter=2, k=22, x=1, y=1] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=2, counter=2, k=22, x=9, y=2] [L27] EXPR counter++ VAL [c=2, counter=3, k=22, x=9, y=2] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=3] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=2, counter=3, k=22, x=9, y=2] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=3, counter=3, k=22, x=36, y=3] [L27] EXPR counter++ VAL [c=3, counter=4, k=22, x=36, y=3] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=4] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=3, counter=4, k=22, x=36, y=3] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=4, counter=4, k=22, x=100, y=4] [L27] EXPR counter++ VAL [c=4, counter=5, k=22, x=100, y=4] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=5] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=4, counter=5, k=22, x=100, y=4] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=5, counter=5, k=22, x=225, y=5] [L27] EXPR counter++ VAL [c=5, counter=6, k=22, x=225, y=5] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=6] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=5, counter=6, k=22, x=225, y=5] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=6, counter=6, k=22, x=441, y=6] [L27] EXPR counter++ VAL [c=6, counter=7, k=22, x=441, y=6] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=7] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=6, counter=7, k=22, x=441, y=6] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=7, counter=7, k=22, x=784, y=7] [L27] EXPR counter++ VAL [c=7, counter=8, k=22, x=784, y=7] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=8] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=7, counter=8, k=22, x=784, y=7] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=8, counter=8, k=22, x=1296, y=8] [L27] EXPR counter++ VAL [c=8, counter=9, k=22, x=1296, y=8] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=9] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=8, counter=9, k=22, x=1296, y=8] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=9, counter=9, k=22, x=2025, y=9] [L27] EXPR counter++ VAL [c=9, counter=10, k=22, x=2025, y=9] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=10] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=9, counter=10, k=22, x=2025, y=9] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=10, counter=10, k=22, x=3025, y=10] [L27] EXPR counter++ VAL [c=10, counter=11, k=22, x=3025, y=10] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=11] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=10, counter=11, k=22, x=3025, y=10] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=11, counter=11, k=22, x=4356, y=11] [L27] EXPR counter++ VAL [c=11, counter=12, k=22, x=4356, y=11] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=12] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=11, counter=12, k=22, x=4356, y=11] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=12, counter=12, k=22, x=6084, y=12] [L27] EXPR counter++ VAL [c=12, counter=13, k=22, x=6084, y=12] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=13] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=12, counter=13, k=22, x=6084, y=12] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=13, counter=13, k=22, x=8281, y=13] [L27] EXPR counter++ VAL [c=13, counter=14, k=22, x=8281, y=13] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=14] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=13, counter=14, k=22, x=8281, y=13] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=14, counter=14, k=22, x=11025, y=14] [L27] EXPR counter++ VAL [c=14, counter=15, k=22, x=11025, y=14] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=15] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=14, counter=15, k=22, x=11025, y=14] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=15, counter=15, k=22, x=14400, y=15] [L27] EXPR counter++ VAL [c=15, counter=16, k=22, x=14400, y=15] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=16] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=15, counter=16, k=22, x=14400, y=15] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=16, counter=16, k=22, x=18496, y=16] [L27] EXPR counter++ VAL [c=16, counter=17, k=22, x=18496, y=16] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=17] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=16, counter=17, k=22, x=18496, y=16] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=17, counter=17, k=22, x=23409, y=17] [L27] EXPR counter++ VAL [c=17, counter=18, k=22, x=23409, y=17] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=18] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=17, counter=18, k=22, x=23409, y=17] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=18, counter=18, k=22, x=29241, y=18] [L27] EXPR counter++ VAL [c=18, counter=19, k=22, x=29241, y=18] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=19] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=18, counter=19, k=22, x=29241, y=18] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=19, counter=19, k=22, x=36100, y=19] [L27] EXPR counter++ VAL [c=19, counter=20, k=22, x=36100, y=19] [L27] COND TRUE counter++<20 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=20] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=19, counter=20, k=22, x=36100, y=19] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=20, counter=20, k=22, x=44100, y=20] [L27] EXPR counter++ VAL [c=20, counter=21, k=22, x=44100, y=20] [L27] COND FALSE !(counter++<20) [L37] CALL __VERIFIER_assert(k*y - (y*y) == 0) VAL [\old(cond)=0, counter=21] [L10] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L12] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 140.5s, OverallIterations: 10, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 235 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 230 mSDsluCounter, 730 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 170 IncrementalHoareTripleChecker+Unchecked, 613 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 511 IncrementalHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 117 mSDtfsCounter, 511 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 501 GetRequests, 359 SyntacticMatches, 5 SemanticMatches, 137 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 21.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=9, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 35 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 129.8s InterpolantComputationTime, 422 NumberOfCodeBlocks, 422 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 449 ConstructedInterpolants, 3 QuantifiedInterpolants, 2138 SizeOfPredicates, 30 NumberOfNonLiveVariables, 862 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 368/1150 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 08:13:45,307 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...