/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 18:08:57,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 18:08:58,041 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-19 18:08:58,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 18:08:58,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 18:08:58,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 18:08:58,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 18:08:58,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 18:08:58,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 18:08:58,071 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 18:08:58,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 18:08:58,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 18:08:58,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 18:08:58,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 18:08:58,073 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 18:08:58,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 18:08:58,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 18:08:58,073 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 18:08:58,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 18:08:58,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 18:08:58,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 18:08:58,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 18:08:58,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 18:08:58,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 18:08:58,075 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 18:08:58,076 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 18:08:58,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 18:08:58,076 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 18:08:58,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 18:08:58,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 18:08:58,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 18:08:58,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 18:08:58,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 18:08:58,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 18:08:58,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 18:08:58,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 18:08:58,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 18:08:58,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 18:08:58,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 18:08:58,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 18:08:58,078 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 18:08:58,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 18:08:58,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 18:08:58,079 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 -> true [2023-12-19 18:08:58,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 18:08:58,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 18:08:58,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 18:08:58,291 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 18:08:58,293 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 18:08:58,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2023-12-19 18:08:59,290 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 18:08:59,426 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 18:08:59,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2023-12-19 18:08:59,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3077641da/a92fc0bfdeb344e793391fc4c05aa58b/FLAG5fe2d3ffc [2023-12-19 18:08:59,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3077641da/a92fc0bfdeb344e793391fc4c05aa58b [2023-12-19 18:08:59,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 18:08:59,455 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 18:08:59,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 18:08:59,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 18:08:59,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 18:08:59,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 06:08:59" (1/1) ... [2023-12-19 18:08:59,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@deb2885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:08:59, skipping insertion in model container [2023-12-19 18:08:59,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 06:08:59" (1/1) ... [2023-12-19 18:08:59,483 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 18:08:59,583 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c[311,324] [2023-12-19 18:08:59,590 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 18:08:59,596 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 18:08:59,603 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c[311,324] [2023-12-19 18:08:59,604 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 18:08:59,612 INFO L206 MainTranslator]: Completed translation [2023-12-19 18:08:59,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:08:59 WrapperNode [2023-12-19 18:08:59,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 18:08:59,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 18:08:59,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 18:08:59,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 18:08:59,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:08:59" (1/1) ... [2023-12-19 18:08:59,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:08:59" (1/1) ... [2023-12-19 18:08:59,630 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 30 [2023-12-19 18:08:59,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 18:08:59,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 18:08:59,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 18:08:59,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 18:08:59,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:08:59" (1/1) ... [2023-12-19 18:08:59,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:08:59" (1/1) ... [2023-12-19 18:08:59,642 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:08:59" (1/1) ... [2023-12-19 18:08:59,648 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-19 18:08:59,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:08:59" (1/1) ... [2023-12-19 18:08:59,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:08:59" (1/1) ... [2023-12-19 18:08:59,649 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:08:59" (1/1) ... [2023-12-19 18:08:59,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:08:59" (1/1) ... [2023-12-19 18:08:59,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:08:59" (1/1) ... [2023-12-19 18:08:59,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:08:59" (1/1) ... [2023-12-19 18:08:59,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 18:08:59,653 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 18:08:59,653 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 18:08:59,653 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 18:08:59,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:08:59" (1/1) ... [2023-12-19 18:08:59,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 18:08:59,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 18:08:59,673 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-19 18:08:59,675 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-19 18:08:59,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 18:08:59,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 18:08:59,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 18:08:59,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 18:08:59,732 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 18:08:59,733 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 18:08:59,835 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 18:08:59,847 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 18:08:59,847 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 18:08:59,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 06:08:59 BoogieIcfgContainer [2023-12-19 18:08:59,848 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 18:08:59,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 18:08:59,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 18:08:59,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 18:08:59,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 06:08:59" (1/3) ... [2023-12-19 18:08:59,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a74fa68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 06:08:59, skipping insertion in model container [2023-12-19 18:08:59,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 06:08:59" (2/3) ... [2023-12-19 18:08:59,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a74fa68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 06:08:59, skipping insertion in model container [2023-12-19 18:08:59,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 06:08:59" (3/3) ... [2023-12-19 18:08:59,853 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono6_1.c [2023-12-19 18:08:59,863 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 18:08:59,864 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 18:08:59,889 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 18:08:59,893 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;@7c0db91e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 18:08:59,893 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 18:08:59,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:08:59,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-19 18:08:59,899 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:08:59,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-19 18:08:59,900 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:08:59,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:08:59,903 INFO L85 PathProgramCache]: Analyzing trace with hash 63417192, now seen corresponding path program 1 times [2023-12-19 18:08:59,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:08:59,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383267764] [2023-12-19 18:08:59,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:08:59,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:08:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:08:59,985 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-19 18:08:59,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:08:59,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383267764] [2023-12-19 18:08:59,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383267764] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 18:08:59,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 18:08:59,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 18:08:59,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371323469] [2023-12-19 18:08:59,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 18:08:59,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 18:08:59,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:09:00,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 18:09:00,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 18:09:00,023 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:00,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 18:09:00,035 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2023-12-19 18:09:00,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 18:09:00,037 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-19 18:09:00,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 18:09:00,047 INFO L225 Difference]: With dead ends: 16 [2023-12-19 18:09:00,048 INFO L226 Difference]: Without dead ends: 8 [2023-12-19 18:09:00,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 18:09:00,051 INFO L413 NwaCegarLoop]: 9 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, 9 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-19 18:09:00,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 18:09:00,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-12-19 18:09:00,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-12-19 18:09:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:00,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2023-12-19 18:09:00,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2023-12-19 18:09:00,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 18:09:00,070 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2023-12-19 18:09:00,070 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:00,070 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2023-12-19 18:09:00,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-19 18:09:00,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:09:00,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-19 18:09:00,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 18:09:00,071 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:09:00,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:09:00,072 INFO L85 PathProgramCache]: Analyzing trace with hash 63089491, now seen corresponding path program 1 times [2023-12-19 18:09:00,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:09:00,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328605751] [2023-12-19 18:09:00,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:09:00,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:09:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:09:00,236 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-19 18:09:00,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:09:00,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328605751] [2023-12-19 18:09:00,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328605751] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 18:09:00,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 18:09:00,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 18:09:00,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736477698] [2023-12-19 18:09:00,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 18:09:00,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 18:09:00,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:09:00,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 18:09:00,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 18:09:00,239 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:00,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 18:09:00,255 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2023-12-19 18:09:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 18:09:00,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-19 18:09:00,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 18:09:00,256 INFO L225 Difference]: With dead ends: 18 [2023-12-19 18:09:00,256 INFO L226 Difference]: Without dead ends: 11 [2023-12-19 18:09:00,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 18:09:00,257 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 18:09:00,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 18:09:00,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-19 18:09:00,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2023-12-19 18:09:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:00,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-12-19 18:09:00,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 5 [2023-12-19 18:09:00,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 18:09:00,260 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-12-19 18:09:00,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:00,261 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-12-19 18:09:00,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-19 18:09:00,261 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:09:00,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 18:09:00,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 18:09:00,261 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:09:00,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:09:00,262 INFO L85 PathProgramCache]: Analyzing trace with hash -100395752, now seen corresponding path program 1 times [2023-12-19 18:09:00,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:09:00,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020236378] [2023-12-19 18:09:00,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:09:00,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:09:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:09:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:09:00,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:09:00,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020236378] [2023-12-19 18:09:00,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020236378] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 18:09:00,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134289910] [2023-12-19 18:09:00,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:09:00,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:09:00,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 18:09:00,480 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-19 18:09:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:09:00,518 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-19 18:09:00,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-19 18:09:00,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 18:09:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:09:00,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 18:09:00,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:09:00,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134289910] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 18:09:00,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 18:09:00,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2023-12-19 18:09:00,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567221399] [2023-12-19 18:09:00,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 18:09:00,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 18:09:00,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:09:00,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 18:09:00,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-19 18:09:00,666 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:00,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 18:09:00,813 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2023-12-19 18:09:00,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 18:09:00,814 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-19 18:09:00,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 18:09:00,815 INFO L225 Difference]: With dead ends: 32 [2023-12-19 18:09:00,815 INFO L226 Difference]: Without dead ends: 21 [2023-12-19 18:09:00,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-12-19 18:09:00,816 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 18:09:00,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 18:09:00,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-19 18:09:00,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2023-12-19 18:09:00,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:00,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-12-19 18:09:00,822 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 8 [2023-12-19 18:09:00,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 18:09:00,822 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-12-19 18:09:00,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:00,822 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-12-19 18:09:00,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-19 18:09:00,824 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:09:00,824 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2023-12-19 18:09:00,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 18:09:01,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:09:01,030 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:09:01,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:09:01,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1140498195, now seen corresponding path program 2 times [2023-12-19 18:09:01,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:09:01,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310115468] [2023-12-19 18:09:01,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:09:01,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:09:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:09:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:09:01,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:09:01,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310115468] [2023-12-19 18:09:01,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310115468] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 18:09:01,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136687402] [2023-12-19 18:09:01,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 18:09:01,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:09:01,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 18:09:01,237 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-19 18:09:01,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-19 18:09:01,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 18:09:01,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-19 18:09:01,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 18:09:01,267 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-19 18:09:01,373 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-19 18:09:01,374 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 18:09:01,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136687402] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 18:09:01,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 18:09:01,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-12-19 18:09:01,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916718710] [2023-12-19 18:09:01,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 18:09:01,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 18:09:01,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:09:01,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 18:09:01,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-19 18:09:01,381 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:01,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 18:09:01,425 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2023-12-19 18:09:01,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 18:09:01,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-19 18:09:01,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 18:09:01,427 INFO L225 Difference]: With dead ends: 29 [2023-12-19 18:09:01,427 INFO L226 Difference]: Without dead ends: 25 [2023-12-19 18:09:01,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-12-19 18:09:01,430 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 18:09:01,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 13 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 18:09:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-19 18:09:01,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-19 18:09:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-12-19 18:09:01,441 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 17 [2023-12-19 18:09:01,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 18:09:01,442 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-12-19 18:09:01,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-12-19 18:09:01,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-19 18:09:01,443 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:09:01,443 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1] [2023-12-19 18:09:01,456 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-19 18:09:01,647 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,SelfDestructingSolverStorable3 [2023-12-19 18:09:01,648 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:09:01,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:09:01,649 INFO L85 PathProgramCache]: Analyzing trace with hash 460439825, now seen corresponding path program 1 times [2023-12-19 18:09:01,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:09:01,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010500129] [2023-12-19 18:09:01,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:09:01,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:09:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:09:01,728 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-19 18:09:01,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:09:01,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010500129] [2023-12-19 18:09:01,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010500129] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 18:09:01,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630690578] [2023-12-19 18:09:01,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:09:01,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:09:01,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 18:09:01,730 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-19 18:09:01,740 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-19 18:09:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:09:01,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-19 18:09:01,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 18:09:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-19 18:09:01,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 18:09:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:09:01,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630690578] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 18:09:01,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 18:09:01,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 8] total 13 [2023-12-19 18:09:01,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250801420] [2023-12-19 18:09:01,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 18:09:01,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 18:09:01,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:09:01,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 18:09:01,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-12-19 18:09:01,963 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:03,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 18:09:03,379 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2023-12-19 18:09:03,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 18:09:03,380 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-19 18:09:03,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 18:09:03,380 INFO L225 Difference]: With dead ends: 52 [2023-12-19 18:09:03,380 INFO L226 Difference]: Without dead ends: 42 [2023-12-19 18:09:03,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2023-12-19 18:09:03,381 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 54 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 18:09:03,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 16 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 18:09:03,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-19 18:09:03,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2023-12-19 18:09:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:03,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2023-12-19 18:09:03,387 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 17 [2023-12-19 18:09:03,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 18:09:03,387 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2023-12-19 18:09:03,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2023-12-19 18:09:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-19 18:09:03,387 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:09:03,387 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2023-12-19 18:09:03,394 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-19 18:09:03,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:09:03,592 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:09:03,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:09:03,593 INFO L85 PathProgramCache]: Analyzing trace with hash 634443802, now seen corresponding path program 2 times [2023-12-19 18:09:03,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:09:03,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624305441] [2023-12-19 18:09:03,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:09:03,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:09:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:09:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:09:03,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:09:03,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624305441] [2023-12-19 18:09:03,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624305441] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 18:09:03,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554713834] [2023-12-19 18:09:03,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 18:09:03,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:09:03,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 18:09:03,684 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-19 18:09:03,710 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-19 18:09:03,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 18:09:03,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 18:09:03,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-19 18:09:03,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 18:09:03,828 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:09:03,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 18:09:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-19 18:09:03,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554713834] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 18:09:03,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 18:09:03,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 20 [2023-12-19 18:09:03,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101955959] [2023-12-19 18:09:03,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 18:09:03,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-19 18:09:03,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:09:03,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-19 18:09:03,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-12-19 18:09:03,956 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:09,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:09:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 18:09:11,109 INFO L93 Difference]: Finished difference Result 120 states and 150 transitions. [2023-12-19 18:09:11,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-19 18:09:11,109 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-19 18:09:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 18:09:11,110 INFO L225 Difference]: With dead ends: 120 [2023-12-19 18:09:11,110 INFO L226 Difference]: Without dead ends: 93 [2023-12-19 18:09:11,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=318, Invalid=1088, Unknown=0, NotChecked=0, Total=1406 [2023-12-19 18:09:11,111 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-12-19 18:09:11,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 22 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 252 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2023-12-19 18:09:11,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-19 18:09:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2023-12-19 18:09:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.25) internal successors, (100), 80 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2023-12-19 18:09:11,127 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 20 [2023-12-19 18:09:11,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 18:09:11,127 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2023-12-19 18:09:11,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2023-12-19 18:09:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-19 18:09:11,128 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:09:11,128 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1] [2023-12-19 18:09:11,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-19 18:09:11,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:09:11,336 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:09:11,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:09:11,337 INFO L85 PathProgramCache]: Analyzing trace with hash 465545237, now seen corresponding path program 3 times [2023-12-19 18:09:11,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:09:11,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553963920] [2023-12-19 18:09:11,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:09:11,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:09:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:09:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 45 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-19 18:09:11,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:09:11,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553963920] [2023-12-19 18:09:11,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553963920] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 18:09:11,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859611874] [2023-12-19 18:09:11,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-19 18:09:11,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:09:11,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 18:09:11,504 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-19 18:09:11,506 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-19 18:09:11,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-19 18:09:11,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 18:09:11,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 18:09:11,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 18:09:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-12-19 18:09:11,591 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 18:09:11,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859611874] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 18:09:11,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 18:09:11,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-12-19 18:09:11,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045021764] [2023-12-19 18:09:11,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 18:09:11,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 18:09:11,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:09:11,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 18:09:11,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-19 18:09:11,592 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:11,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 18:09:11,630 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2023-12-19 18:09:11,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 18:09:11,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-12-19 18:09:11,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 18:09:11,634 INFO L225 Difference]: With dead ends: 109 [2023-12-19 18:09:11,634 INFO L226 Difference]: Without dead ends: 105 [2023-12-19 18:09:11,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-19 18:09:11,635 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 18:09:11,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 7 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 18:09:11,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-19 18:09:11,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2023-12-19 18:09:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 69 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2023-12-19 18:09:11,654 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 29 [2023-12-19 18:09:11,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 18:09:11,655 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2023-12-19 18:09:11,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:11,655 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2023-12-19 18:09:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-19 18:09:11,656 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:09:11,656 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 2, 1, 1, 1, 1, 1] [2023-12-19 18:09:11,676 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-19 18:09:11,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:09:11,861 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:09:11,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:09:11,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2147215400, now seen corresponding path program 4 times [2023-12-19 18:09:11,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:09:11,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72331033] [2023-12-19 18:09:11,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:09:11,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:09:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:09:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 62 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-19 18:09:11,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:09:11,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72331033] [2023-12-19 18:09:11,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72331033] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 18:09:11,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787053867] [2023-12-19 18:09:11,961 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-19 18:09:11,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:09:11,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 18:09:11,978 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-19 18:09:12,021 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-19 18:09:12,028 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-19 18:09:12,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 18:09:12,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-19 18:09:12,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 18:09:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:09:12,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 18:09:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-19 18:09:12,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787053867] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 18:09:12,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 18:09:12,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 10] total 29 [2023-12-19 18:09:12,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243938097] [2023-12-19 18:09:12,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 18:09:12,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-19 18:09:12,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:09:12,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-19 18:09:12,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2023-12-19 18:09:12,568 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 30 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 29 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:09:28,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:09:33,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:09:37,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:09:41,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:09:45,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:09:58,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:10:03,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:10:07,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:10:09,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:10:17,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:10:20,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:10:22,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:10:25,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:10:29,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:10:35,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 18:10:35,239 INFO L93 Difference]: Finished difference Result 158 states and 195 transitions. [2023-12-19 18:10:35,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-19 18:10:35,239 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 29 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-19 18:10:35,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 18:10:35,240 INFO L225 Difference]: With dead ends: 158 [2023-12-19 18:10:35,240 INFO L226 Difference]: Without dead ends: 107 [2023-12-19 18:10:35,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=577, Invalid=1873, Unknown=0, NotChecked=0, Total=2450 [2023-12-19 18:10:35,242 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 20 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.3s IncrementalHoareTripleChecker+Time [2023-12-19 18:10:35,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 32 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 430 Invalid, 9 Unknown, 0 Unchecked, 57.3s Time] [2023-12-19 18:10:35,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-19 18:10:35,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 57. [2023-12-19 18:10:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 56 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:10:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2023-12-19 18:10:35,251 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 32 [2023-12-19 18:10:35,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 18:10:35,251 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2023-12-19 18:10:35,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 29 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:10:35,251 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2023-12-19 18:10:35,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-19 18:10:35,252 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:10:35,252 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 2, 1, 1, 1, 1, 1] [2023-12-19 18:10:35,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-19 18:10:35,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:10:35,453 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:10:35,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:10:35,453 INFO L85 PathProgramCache]: Analyzing trace with hash -686814637, now seen corresponding path program 5 times [2023-12-19 18:10:35,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:10:35,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73148356] [2023-12-19 18:10:35,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:10:35,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:10:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:10:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 113 proven. 57 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-19 18:10:35,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:10:35,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73148356] [2023-12-19 18:10:35,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73148356] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 18:10:35,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978316448] [2023-12-19 18:10:35,591 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-19 18:10:35,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:10:35,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 18:10:35,592 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-19 18:10:35,596 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-19 18:10:35,648 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-19 18:10:35,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 18:10:35,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-19 18:10:35,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 18:10:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 132 proven. 1 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-12-19 18:10:35,702 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 18:10:35,742 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 132 proven. 1 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-12-19 18:10:35,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978316448] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 18:10:35,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 18:10:35,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2023-12-19 18:10:35,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470528303] [2023-12-19 18:10:35,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 18:10:35,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 18:10:35,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:10:35,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 18:10:35,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-12-19 18:10:35,744 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:10:35,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 18:10:35,863 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2023-12-19 18:10:35,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 18:10:35,863 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-12-19 18:10:35,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 18:10:35,864 INFO L225 Difference]: With dead ends: 100 [2023-12-19 18:10:35,864 INFO L226 Difference]: Without dead ends: 53 [2023-12-19 18:10:35,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-12-19 18:10:35,864 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 18:10:35,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 12 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 18:10:35,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-19 18:10:35,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2023-12-19 18:10:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:10:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2023-12-19 18:10:35,870 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 41 [2023-12-19 18:10:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 18:10:35,870 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2023-12-19 18:10:35,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:10:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2023-12-19 18:10:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-19 18:10:35,871 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:10:35,871 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1] [2023-12-19 18:10:35,879 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-19 18:10:36,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:10:36,080 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:10:36,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:10:36,080 INFO L85 PathProgramCache]: Analyzing trace with hash 723900090, now seen corresponding path program 6 times [2023-12-19 18:10:36,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:10:36,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215616462] [2023-12-19 18:10:36,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:10:36,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:10:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:10:36,296 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:10:36,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:10:36,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215616462] [2023-12-19 18:10:36,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215616462] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 18:10:36,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718882144] [2023-12-19 18:10:36,296 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-19 18:10:36,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:10:36,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 18:10:36,297 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-19 18:10:36,354 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-19 18:10:36,379 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-12-19 18:10:36,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 18:10:36,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-19 18:10:36,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 18:10:36,570 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2023-12-19 18:10:36,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 18:10:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2023-12-19 18:10:36,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718882144] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 18:10:36,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 18:10:36,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5, 5] total 24 [2023-12-19 18:10:36,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273179684] [2023-12-19 18:10:36,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 18:10:36,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-19 18:10:36,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:10:36,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-19 18:10:36,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2023-12-19 18:10:36,709 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 25 states, 25 states have (on average 2.72) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:10:37,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 18:10:37,360 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2023-12-19 18:10:37,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-19 18:10:37,361 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.72) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-12-19 18:10:37,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 18:10:37,361 INFO L225 Difference]: With dead ends: 80 [2023-12-19 18:10:37,361 INFO L226 Difference]: Without dead ends: 67 [2023-12-19 18:10:37,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=329, Invalid=1927, Unknown=0, NotChecked=0, Total=2256 [2023-12-19 18:10:37,362 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 52 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 18:10:37,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 42 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 18:10:37,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-19 18:10:37,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2023-12-19 18:10:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:10:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2023-12-19 18:10:37,368 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 50 [2023-12-19 18:10:37,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 18:10:37,369 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2023-12-19 18:10:37,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.72) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:10:37,369 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2023-12-19 18:10:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-19 18:10:37,369 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:10:37,369 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 15, 4, 1, 1, 1, 1, 1] [2023-12-19 18:10:37,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-19 18:10:37,570 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,SelfDestructingSolverStorable9 [2023-12-19 18:10:37,570 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:10:37,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:10:37,571 INFO L85 PathProgramCache]: Analyzing trace with hash 29621688, now seen corresponding path program 7 times [2023-12-19 18:10:37,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:10:37,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346776115] [2023-12-19 18:10:37,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:10:37,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:10:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:10:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 172 proven. 345 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-19 18:10:37,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:10:37,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346776115] [2023-12-19 18:10:37,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346776115] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 18:10:37,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490306572] [2023-12-19 18:10:37,852 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-19 18:10:37,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:10:37,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 18:10:37,853 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-19 18:10:37,855 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-19 18:10:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:10:37,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-19 18:10:37,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 18:10:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 172 proven. 345 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-19 18:10:37,996 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 18:10:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 172 proven. 345 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-19 18:10:38,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490306572] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 18:10:38,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 18:10:38,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 35 [2023-12-19 18:10:38,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617341514] [2023-12-19 18:10:38,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 18:10:38,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-19 18:10:38,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:10:38,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-19 18:10:38,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=885, Unknown=0, NotChecked=0, Total=1260 [2023-12-19 18:10:38,648 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 35 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:11:06,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 18:11:06,809 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2023-12-19 18:11:06,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-19 18:11:06,810 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 35 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-12-19 18:11:06,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 18:11:06,811 INFO L225 Difference]: With dead ends: 129 [2023-12-19 18:11:06,811 INFO L226 Difference]: Without dead ends: 114 [2023-12-19 18:11:06,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=915, Invalid=1635, Unknown=0, NotChecked=0, Total=2550 [2023-12-19 18:11:06,812 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 18:11:06,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 45 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 18:11:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-19 18:11:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-12-19 18:11:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.0176991150442478) internal successors, (115), 113 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:11:06,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2023-12-19 18:11:06,825 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 62 [2023-12-19 18:11:06,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 18:11:06,826 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2023-12-19 18:11:06,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 35 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:11:06,826 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2023-12-19 18:11:06,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 18:11:06,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 18:11:06,827 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 32, 4, 1, 1, 1, 1, 1] [2023-12-19 18:11:06,834 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-19 18:11:07,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:11:07,032 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 18:11:07,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 18:11:07,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1295715987, now seen corresponding path program 8 times [2023-12-19 18:11:07,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 18:11:07,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623906529] [2023-12-19 18:11:07,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 18:11:07,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 18:11:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 18:11:07,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 359 proven. 1552 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-19 18:11:07,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 18:11:07,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623906529] [2023-12-19 18:11:07,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623906529] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 18:11:07,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513063854] [2023-12-19 18:11:07,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 18:11:07,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 18:11:07,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 18:11:07,927 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-19 18:11:07,930 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-19 18:11:07,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 18:11:07,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 18:11:08,000 WARN L260 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 98 conjunts are in the unsatisfiable core [2023-12-19 18:11:08,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 18:11:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 18:11:09,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 18:11:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1900 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-19 18:11:12,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513063854] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 18:11:12,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 18:11:12,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 43, 35] total 110 [2023-12-19 18:11:12,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330160216] [2023-12-19 18:11:12,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 18:11:12,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2023-12-19 18:11:12,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 18:11:12,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2023-12-19 18:11:12,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1671, Invalid=10539, Unknown=0, NotChecked=0, Total=12210 [2023-12-19 18:11:12,029 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand has 111 states, 111 states have (on average 2.8828828828828827) internal successors, (320), 110 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 18:11:17,590 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-12-19 18:11:21,621 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-12-19 18:11:25,637 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-12-19 18:11:29,709 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-12-19 18:11:33,760 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-12-19 18:11:37,781 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-12-19 18:11:41,811 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-12-19 18:11:45,821 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-12-19 18:11:49,835 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-12-19 18:11:53,897 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-12-19 18:11:57,978 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-12-19 18:18:31,364 WARN L293 SmtUtils]: Spent 3.26m on a formula simplification that was a NOOP. DAG size: 140 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 18:18:32,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:18:36,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:18:40,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:18:43,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:18:47,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 18:18:51,692 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-12-19 18:18:55,704 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2023-12-19 18:18:59,714 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false Received shutdown request... [2023-12-19 18:23:45,523 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-19 18:23:45,527 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-19 18:23:46,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-19 18:23:46,729 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-19 18:23:46,734 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 137 [2023-12-19 18:23:46,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-12-19 18:23:46,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 147 SyntacticMatches, 4 SemanticMatches, 125 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 2368 ImplicationChecksByTransitivity, 453.7s TimeCoverageRelationStatistics Valid=1774, Invalid=10900, Unknown=38, NotChecked=3290, Total=16002 [2023-12-19 18:23:46,738 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 3 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6085 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6085 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 2543 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2023-12-19 18:23:46,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 0 Invalid, 8633 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 6085 Invalid, 3 Unknown, 2543 Unchecked, 17.8s Time] [2023-12-19 18:23:46,739 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 18:23:46,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 18:23:46,740 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (114states) and FLOYD_HOARE automaton (currently 53 states, 111 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. [2023-12-19 18:23:46,743 INFO L445 BasicCegarLoop]: Path program histogram: [8, 2, 1, 1] [2023-12-19 18:23:46,745 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 18:23:46,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 06:23:46 BoogieIcfgContainer [2023-12-19 18:23:46,749 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 18:23:46,749 INFO L158 Benchmark]: Toolchain (without parser) took 887294.97ms. Allocated memory was 221.2MB in the beginning and 276.8MB in the end (delta: 55.6MB). Free memory was 180.0MB in the beginning and 103.7MB in the end (delta: 76.3MB). Peak memory consumption was 133.2MB. Max. memory is 8.0GB. [2023-12-19 18:23:46,750 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 221.2MB. Free memory was 168.8MB in the beginning and 168.6MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 18:23:46,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.46ms. Allocated memory is still 221.2MB. Free memory was 179.7MB in the beginning and 169.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-19 18:23:46,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.90ms. Allocated memory is still 221.2MB. Free memory was 169.2MB in the beginning and 167.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-19 18:23:46,763 INFO L158 Benchmark]: Boogie Preprocessor took 21.63ms. Allocated memory is still 221.2MB. Free memory was 167.8MB in the beginning and 166.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 18:23:46,763 INFO L158 Benchmark]: RCFGBuilder took 195.03ms. Allocated memory is still 221.2MB. Free memory was 166.1MB in the beginning and 156.6MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-12-19 18:23:46,763 INFO L158 Benchmark]: TraceAbstraction took 886899.85ms. Allocated memory was 221.2MB in the beginning and 276.8MB in the end (delta: 55.6MB). Free memory was 155.9MB in the beginning and 103.7MB in the end (delta: 52.2MB). Peak memory consumption was 109.1MB. Max. memory is 8.0GB. [2023-12-19 18:23:46,765 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 221.2MB. Free memory was 168.8MB in the beginning and 168.6MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 156.46ms. Allocated memory is still 221.2MB. Free memory was 179.7MB in the beginning and 169.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 16.90ms. Allocated memory is still 221.2MB. Free memory was 169.2MB in the beginning and 167.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.63ms. Allocated memory is still 221.2MB. Free memory was 167.8MB in the beginning and 166.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 195.03ms. Allocated memory is still 221.2MB. Free memory was 166.1MB in the beginning and 156.6MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 886899.85ms. Allocated memory was 221.2MB in the beginning and 276.8MB in the end (delta: 55.6MB). Free memory was 155.9MB in the beginning and 103.7MB in the end (delta: 52.2MB). Peak memory consumption was 109.1MB. 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 - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4). Cancelled while NwaCegarLoop was constructing difference of abstraction (114states) and FLOYD_HOARE automaton (currently 53 states, 111 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 886.9s, OverallIterations: 12, TraceHistogramMax: 36, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 875.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 211 SdHoareTripleChecker+Valid, 82.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 211 mSDsluCounter, 216 SdHoareTripleChecker+Invalid, 81.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2543 IncrementalHoareTripleChecker+Unchecked, 177 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8968 IncrementalHoareTripleChecker+Invalid, 11631 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 39 mSDtfsCounter, 8968 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 959 GetRequests, 574 SyntacticMatches, 8 SemanticMatches, 376 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 3841 ImplicationChecksByTransitivity, 511.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=11, InterpolantAutomatonStates: 174, 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, 11 MinimizatonAttempts, 111 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 788 NumberOfCodeBlocks, 693 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1101 ConstructedInterpolants, 0 QuantifiedInterpolants, 6104 SizeOfPredicates, 40 NumberOfNonLiveVariables, 705 ConjunctsInSsa, 258 ConjunctsInUnsatCore, 30 InterpolantComputations, 4 PerfectInterpolantSequences, 2452/9747 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 could not prove your program: Timeout Completed graceful shutdown