/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-64bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cal181.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 16:00:36,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 16:00:37,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2023-12-25 16:00:37,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 16:00:37,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 16:00:37,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 16:00:37,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 16:00:37,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 16:00:37,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 16:00:37,080 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 16:00:37,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 16:00:37,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 16:00:37,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 16:00:37,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 16:00:37,081 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 16:00:37,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 16:00:37,082 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 16:00:37,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-25 16:00:37,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 16:00:37,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 16:00:37,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 16:00:37,083 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 16:00:37,083 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 16:00:37,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 16:00:37,084 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 16:00:37,084 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 16:00:37,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 16:00:37,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 16:00:37,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 16:00:37,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 16:00:37,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 16:00:37,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 16:00:37,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 16:00:37,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-25 16:00:37,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-25 16:00:37,086 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 16:00:37,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 16:00:37,086 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 16:00:37,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 16:00:37,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 16:00:37,086 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-25 16:00:37,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 16:00:37,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 16:00:37,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 16:00:37,299 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 16:00:37,300 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 16:00:37,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cal181.c [2023-12-25 16:00:38,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 16:00:38,439 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 16:00:38,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cal181.c [2023-12-25 16:00:38,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e16e8d3b9/d5d6ee54ed934c88b43b874384eb41f7/FLAG5f5a1ca8a [2023-12-25 16:00:38,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e16e8d3b9/d5d6ee54ed934c88b43b874384eb41f7 [2023-12-25 16:00:38,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 16:00:38,460 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 16:00:38,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 16:00:38,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 16:00:38,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 16:00:38,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:00:38" (1/1) ... [2023-12-25 16:00:38,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@359c3ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:00:38, skipping insertion in model container [2023-12-25 16:00:38,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:00:38" (1/1) ... [2023-12-25 16:00:38,490 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 16:00:38,614 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cal181.c[1246,1259] [2023-12-25 16:00:38,667 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 16:00:38,681 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 16:00:38,692 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cal181.c[1246,1259] [2023-12-25 16:00:38,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 16:00:38,733 INFO L206 MainTranslator]: Completed translation [2023-12-25 16:00:38,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:00:38 WrapperNode [2023-12-25 16:00:38,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 16:00:38,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 16:00:38,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 16:00:38,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 16:00:38,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:00:38" (1/1) ... [2023-12-25 16:00:38,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:00:38" (1/1) ... [2023-12-25 16:00:38,794 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 224 [2023-12-25 16:00:38,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 16:00:38,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 16:00:38,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 16:00:38,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 16:00:38,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:00:38" (1/1) ... [2023-12-25 16:00:38,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:00:38" (1/1) ... [2023-12-25 16:00:38,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:00:38" (1/1) ... [2023-12-25 16:00:38,838 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-25 16:00:38,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:00:38" (1/1) ... [2023-12-25 16:00:38,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:00:38" (1/1) ... [2023-12-25 16:00:38,845 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:00:38" (1/1) ... [2023-12-25 16:00:38,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:00:38" (1/1) ... [2023-12-25 16:00:38,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:00:38" (1/1) ... [2023-12-25 16:00:38,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:00:38" (1/1) ... [2023-12-25 16:00:38,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 16:00:38,853 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 16:00:38,853 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 16:00:38,853 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 16:00:38,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:00:38" (1/1) ... [2023-12-25 16:00:38,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 16:00:38,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 16:00:38,897 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-25 16:00:38,916 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-25 16:00:38,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 16:00:38,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-25 16:00:38,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 16:00:38,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 16:00:38,985 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 16:00:38,987 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 16:00:39,225 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 16:00:39,244 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 16:00:39,244 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 16:00:39,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:00:39 BoogieIcfgContainer [2023-12-25 16:00:39,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 16:00:39,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 16:00:39,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 16:00:39,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 16:00:39,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 04:00:38" (1/3) ... [2023-12-25 16:00:39,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c82c300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:00:39, skipping insertion in model container [2023-12-25 16:00:39,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:00:38" (2/3) ... [2023-12-25 16:00:39,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c82c300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:00:39, skipping insertion in model container [2023-12-25 16:00:39,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:00:39" (3/3) ... [2023-12-25 16:00:39,250 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal181.c [2023-12-25 16:00:39,265 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 16:00:39,265 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 16:00:39,294 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 16:00:39,299 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;@5e58a8d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 16:00:39,299 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 16:00:39,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 40 states have internal predecessors, (65), 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-25 16:00:39,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-25 16:00:39,308 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 16:00:39,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 16:00:39,309 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 16:00:39,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 16:00:39,313 INFO L85 PathProgramCache]: Analyzing trace with hash -319799101, now seen corresponding path program 1 times [2023-12-25 16:00:39,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 16:00:39,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222996276] [2023-12-25 16:00:39,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 16:00:39,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 16:00:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 16:00:39,716 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-25 16:00:39,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 16:00:39,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222996276] [2023-12-25 16:00:39,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222996276] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 16:00:39,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 16:00:39,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 16:00:39,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276814891] [2023-12-25 16:00:39,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 16:00:39,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 16:00:39,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 16:00:39,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 16:00:39,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 16:00:39,740 INFO L87 Difference]: Start difference. First operand has 41 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 40 states have internal predecessors, (65), 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 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-25 16:00:39,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 16:00:39,777 INFO L93 Difference]: Finished difference Result 69 states and 111 transitions. [2023-12-25 16:00:39,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 16:00:39,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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 22 [2023-12-25 16:00:39,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 16:00:39,785 INFO L225 Difference]: With dead ends: 69 [2023-12-25 16:00:39,785 INFO L226 Difference]: Without dead ends: 41 [2023-12-25 16:00:39,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 16:00:39,790 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 16:00:39,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 169 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 16:00:39,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-25 16:00:39,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-12-25 16:00:39,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.575) internal successors, (63), 40 states have internal predecessors, (63), 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-25 16:00:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2023-12-25 16:00:39,813 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 63 transitions. Word has length 22 [2023-12-25 16:00:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 16:00:39,813 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 63 transitions. [2023-12-25 16:00:39,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-25 16:00:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 63 transitions. [2023-12-25 16:00:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 16:00:39,814 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 16:00:39,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 16:00:39,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-25 16:00:39,814 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 16:00:39,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 16:00:39,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1322112483, now seen corresponding path program 1 times [2023-12-25 16:00:39,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 16:00:39,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036343259] [2023-12-25 16:00:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 16:00:39,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 16:00:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 16:00:39,919 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-25 16:00:39,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 16:00:39,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036343259] [2023-12-25 16:00:39,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036343259] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 16:00:39,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 16:00:39,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 16:00:39,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103133977] [2023-12-25 16:00:39,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 16:00:39,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 16:00:39,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 16:00:39,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 16:00:39,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 16:00:39,921 INFO L87 Difference]: Start difference. First operand 41 states and 63 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-25 16:00:39,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 16:00:39,945 INFO L93 Difference]: Finished difference Result 72 states and 109 transitions. [2023-12-25 16:00:39,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 16:00:39,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2023-12-25 16:00:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 16:00:39,948 INFO L225 Difference]: With dead ends: 72 [2023-12-25 16:00:39,948 INFO L226 Difference]: Without dead ends: 44 [2023-12-25 16:00:39,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 16:00:39,949 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 16:00:39,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 167 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 16:00:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-25 16:00:39,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2023-12-25 16:00:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 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-25 16:00:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 65 transitions. [2023-12-25 16:00:39,957 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 65 transitions. Word has length 23 [2023-12-25 16:00:39,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 16:00:39,957 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 65 transitions. [2023-12-25 16:00:39,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-25 16:00:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 65 transitions. [2023-12-25 16:00:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-25 16:00:39,958 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 16:00:39,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 16:00:39,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-25 16:00:39,958 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 16:00:39,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 16:00:39,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1753753629, now seen corresponding path program 1 times [2023-12-25 16:00:39,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 16:00:39,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405743897] [2023-12-25 16:00:39,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 16:00:39,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 16:00:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 16:00:40,263 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-25 16:00:40,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 16:00:40,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405743897] [2023-12-25 16:00:40,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405743897] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 16:00:40,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 16:00:40,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 16:00:40,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122065778] [2023-12-25 16:00:40,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 16:00:40,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 16:00:40,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 16:00:40,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 16:00:40,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 16:00:40,270 INFO L87 Difference]: Start difference. First operand 43 states and 65 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-25 16:00:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 16:00:40,385 INFO L93 Difference]: Finished difference Result 110 states and 164 transitions. [2023-12-25 16:00:40,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 16:00:40,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2023-12-25 16:00:40,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 16:00:40,387 INFO L225 Difference]: With dead ends: 110 [2023-12-25 16:00:40,387 INFO L226 Difference]: Without dead ends: 80 [2023-12-25 16:00:40,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-25 16:00:40,389 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 214 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 16:00:40,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 222 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 16:00:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-25 16:00:40,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 51. [2023-12-25 16:00:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.54) internal successors, (77), 50 states have internal predecessors, (77), 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-25 16:00:40,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 77 transitions. [2023-12-25 16:00:40,400 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 77 transitions. Word has length 24 [2023-12-25 16:00:40,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 16:00:40,400 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 77 transitions. [2023-12-25 16:00:40,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-25 16:00:40,401 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 77 transitions. [2023-12-25 16:00:40,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-25 16:00:40,404 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 16:00:40,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 16:00:40,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-25 16:00:40,408 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 16:00:40,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 16:00:40,409 INFO L85 PathProgramCache]: Analyzing trace with hash 131694531, now seen corresponding path program 1 times [2023-12-25 16:00:40,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 16:00:40,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492394876] [2023-12-25 16:00:40,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 16:00:40,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 16:00:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 16:00:40,590 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-25 16:00:40,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 16:00:40,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492394876] [2023-12-25 16:00:40,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492394876] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 16:00:40,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 16:00:40,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 16:00:40,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142876213] [2023-12-25 16:00:40,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 16:00:40,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 16:00:40,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 16:00:40,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 16:00:40,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-25 16:00:40,595 INFO L87 Difference]: Start difference. First operand 51 states and 77 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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-25 16:00:40,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 16:00:40,760 INFO L93 Difference]: Finished difference Result 133 states and 197 transitions. [2023-12-25 16:00:40,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 16:00:40,760 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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 25 [2023-12-25 16:00:40,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 16:00:40,763 INFO L225 Difference]: With dead ends: 133 [2023-12-25 16:00:40,763 INFO L226 Difference]: Without dead ends: 103 [2023-12-25 16:00:40,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2023-12-25 16:00:40,770 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 337 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 16:00:40,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 341 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 16:00:40,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-25 16:00:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 54. [2023-12-25 16:00:40,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.528301886792453) internal successors, (81), 53 states have internal predecessors, (81), 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-25 16:00:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 81 transitions. [2023-12-25 16:00:40,775 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 81 transitions. Word has length 25 [2023-12-25 16:00:40,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 16:00:40,775 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 81 transitions. [2023-12-25 16:00:40,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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-25 16:00:40,775 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 81 transitions. [2023-12-25 16:00:40,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-25 16:00:40,776 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 16:00:40,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 16:00:40,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-25 16:00:40,776 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 16:00:40,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 16:00:40,777 INFO L85 PathProgramCache]: Analyzing trace with hash -261332479, now seen corresponding path program 1 times [2023-12-25 16:00:40,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 16:00:40,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980419198] [2023-12-25 16:00:40,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 16:00:40,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 16:00:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 16:00:41,165 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-25 16:00:41,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 16:00:41,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980419198] [2023-12-25 16:00:41,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980419198] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 16:00:41,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 16:00:41,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 16:00:41,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514456879] [2023-12-25 16:00:41,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 16:00:41,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 16:00:41,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 16:00:41,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 16:00:41,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-25 16:00:41,168 INFO L87 Difference]: Start difference. First operand 54 states and 81 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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-25 16:00:41,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 16:00:41,416 INFO L93 Difference]: Finished difference Result 134 states and 199 transitions. [2023-12-25 16:00:41,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 16:00:41,417 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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 25 [2023-12-25 16:00:41,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 16:00:41,418 INFO L225 Difference]: With dead ends: 134 [2023-12-25 16:00:41,418 INFO L226 Difference]: Without dead ends: 104 [2023-12-25 16:00:41,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2023-12-25 16:00:41,419 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 287 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 16:00:41,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 425 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 16:00:41,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-25 16:00:41,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 57. [2023-12-25 16:00:41,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 56 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-25 16:00:41,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2023-12-25 16:00:41,427 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 25 [2023-12-25 16:00:41,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 16:00:41,427 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2023-12-25 16:00:41,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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-25 16:00:41,427 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2023-12-25 16:00:41,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-25 16:00:41,428 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 16:00:41,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 16:00:41,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-25 16:00:41,428 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 16:00:41,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 16:00:41,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1513674883, now seen corresponding path program 1 times [2023-12-25 16:00:41,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 16:00:41,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800343281] [2023-12-25 16:00:41,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 16:00:41,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 16:00:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 16:00:41,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 16:00:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 16:00:41,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-25 16:00:41,481 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 16:00:41,482 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 16:00:41,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-25 16:00:41,485 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-25 16:00:41,488 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 16:00:41,526 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-25 16:00:41,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 04:00:41 BoogieIcfgContainer [2023-12-25 16:00:41,533 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 16:00:41,533 INFO L158 Benchmark]: Toolchain (without parser) took 3072.89ms. Allocated memory was 245.4MB in the beginning and 305.1MB in the end (delta: 59.8MB). Free memory was 192.5MB in the beginning and 157.0MB in the end (delta: 35.5MB). Peak memory consumption was 96.3MB. Max. memory is 8.0GB. [2023-12-25 16:00:41,533 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 197.1MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 16:00:41,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.68ms. Allocated memory is still 245.4MB. Free memory was 191.9MB in the beginning and 179.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 16:00:41,534 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.70ms. Allocated memory is still 245.4MB. Free memory was 179.2MB in the beginning and 175.2MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-25 16:00:41,534 INFO L158 Benchmark]: Boogie Preprocessor took 57.47ms. Allocated memory is still 245.4MB. Free memory was 175.2MB in the beginning and 172.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 16:00:41,534 INFO L158 Benchmark]: RCFGBuilder took 391.69ms. Allocated memory is still 245.4MB. Free memory was 172.0MB in the beginning and 147.4MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-25 16:00:41,535 INFO L158 Benchmark]: TraceAbstraction took 2286.97ms. Allocated memory was 245.4MB in the beginning and 305.1MB in the end (delta: 59.8MB). Free memory was 146.3MB in the beginning and 157.0MB in the end (delta: -10.7MB). Peak memory consumption was 50.2MB. Max. memory is 8.0GB. [2023-12-25 16:00:41,536 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.10ms. Allocated memory is still 197.1MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 272.68ms. Allocated memory is still 245.4MB. Free memory was 191.9MB in the beginning and 179.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.70ms. Allocated memory is still 245.4MB. Free memory was 179.2MB in the beginning and 175.2MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.47ms. Allocated memory is still 245.4MB. Free memory was 175.2MB in the beginning and 172.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 391.69ms. Allocated memory is still 245.4MB. Free memory was 172.0MB in the beginning and 147.4MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2286.97ms. Allocated memory was 245.4MB in the beginning and 305.1MB in the end (delta: 59.8MB). Free memory was 146.3MB in the beginning and 157.0MB in the end (delta: -10.7MB). Peak memory consumption was 50.2MB. 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 79, overapproximation of bitwiseAnd at line 84. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 32); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (32 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_3 var_7 = 0; [L33] const SORT_1 var_11 = 0; [L34] const SORT_3 var_24 = 1; [L36] SORT_1 input_2; [L37] SORT_3 input_4; [L38] SORT_1 input_5; [L39] SORT_1 input_6; [L41] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=4294967295, mask_SORT_3=1, msb_SORT_1=2147483648, msb_SORT_3=1, var_11=0, var_24=1, var_7=0] [L41] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L42] EXPR __VERIFIER_nondet_uint() & mask_SORT_1 VAL [mask_SORT_1=4294967295, mask_SORT_3=1, msb_SORT_1=2147483648, msb_SORT_3=1, state_8=0, var_11=0, var_24=1, var_7=0] [L42] SORT_1 state_12 = __VERIFIER_nondet_uint() & mask_SORT_1; [L43] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=4294967295, mask_SORT_3=1, msb_SORT_1=2147483648, msb_SORT_3=1, state_12=0, state_8=0, var_11=0, var_24=1, var_7=0] [L43] SORT_3 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L44] EXPR __VERIFIER_nondet_uint() & mask_SORT_1 VAL [mask_SORT_1=4294967295, mask_SORT_3=1, msb_SORT_1=2147483648, msb_SORT_3=1, state_12=0, state_14=0, state_8=0, var_11=0, var_24=1, var_7=0] [L44] SORT_1 state_17 = __VERIFIER_nondet_uint() & mask_SORT_1; [L46] SORT_3 init_9_arg_1 = var_7; [L47] state_8 = init_9_arg_1 [L48] SORT_1 init_13_arg_1 = var_11; [L49] state_12 = init_13_arg_1 [L50] SORT_3 init_15_arg_1 = var_7; [L51] state_14 = init_15_arg_1 [L52] SORT_1 init_18_arg_1 = var_11; [L53] state_17 = init_18_arg_1 VAL [init_13_arg_1=0, init_15_arg_1=0, init_18_arg_1=0, init_9_arg_1=0, mask_SORT_1=4294967295, mask_SORT_3=1, msb_SORT_1=2147483648, msb_SORT_3=1, state_12=0, state_14=0, state_17=0, state_8=0, var_11=0, var_24=1, var_7=0] [L56] input_2 = __VERIFIER_nondet_uint() [L57] input_4 = __VERIFIER_nondet_uchar() [L58] input_5 = __VERIFIER_nondet_uint() [L59] input_6 = __VERIFIER_nondet_uint() [L62] SORT_3 var_10_arg_0 = state_8; [L63] SORT_3 var_10 = ~var_10_arg_0; [L64] SORT_3 var_16_arg_0 = state_14; [L65] SORT_1 var_16_arg_1 = state_12; [L66] SORT_1 var_16_arg_2 = input_2; [L67] SORT_1 var_16 = var_16_arg_0 ? var_16_arg_1 : var_16_arg_2; VAL [init_13_arg_1=0, init_15_arg_1=0, init_18_arg_1=0, init_9_arg_1=0, input_2=0, mask_SORT_1=4294967295, mask_SORT_3=1, msb_SORT_1=2147483648, msb_SORT_3=1, state_12=0, state_14=0, state_17=0, state_8=0, var_10=255, var_10_arg_0=0, var_11=0, var_16=0, var_16_arg_0=0, var_16_arg_1=0, var_16_arg_2=0, var_24=1, var_7=0] [L68] EXPR var_16 & mask_SORT_1 VAL [init_13_arg_1=0, init_15_arg_1=0, init_18_arg_1=0, init_9_arg_1=0, input_2=0, mask_SORT_1=4294967295, mask_SORT_3=1, msb_SORT_1=2147483648, msb_SORT_3=1, state_12=0, state_14=0, state_17=0, state_8=0, var_10=255, var_10_arg_0=0, var_11=0, var_16=0, var_16_arg_0=0, var_16_arg_1=0, var_16_arg_2=0, var_24=1, var_7=0] [L68] var_16 = var_16 & mask_SORT_1 [L69] SORT_3 var_19_arg_0 = state_14; [L70] SORT_1 var_19_arg_1 = state_17; [L71] SORT_1 var_19_arg_2 = input_2; [L72] SORT_1 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; VAL [init_13_arg_1=0, init_15_arg_1=0, init_18_arg_1=0, init_9_arg_1=0, input_2=0, mask_SORT_1=4294967295, mask_SORT_3=1, msb_SORT_1=2147483648, msb_SORT_3=1, state_12=0, state_14=0, state_17=0, state_8=0, var_10=255, var_10_arg_0=0, var_11=0, var_16=0, var_16_arg_0=0, var_16_arg_1=0, var_16_arg_2=0, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_19_arg_2=0, var_24=1, var_7=0] [L73] EXPR var_19 & mask_SORT_1 VAL [init_13_arg_1=0, init_15_arg_1=0, init_18_arg_1=0, init_9_arg_1=0, input_2=0, mask_SORT_1=4294967295, mask_SORT_3=1, msb_SORT_1=2147483648, msb_SORT_3=1, state_12=0, state_14=0, state_17=0, state_8=0, var_10=255, var_10_arg_0=0, var_11=0, var_16=0, var_16_arg_0=0, var_16_arg_1=0, var_16_arg_2=0, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_19_arg_2=0, var_24=1, var_7=0] [L73] var_19 = var_19 & mask_SORT_1 [L74] SORT_1 var_20_arg_0 = var_16; [L75] SORT_1 var_20_arg_1 = var_19; [L76] SORT_3 var_20 = var_20_arg_0 == var_20_arg_1; [L77] SORT_3 var_21_arg_0 = var_10; [L78] SORT_3 var_21_arg_1 = var_20; VAL [init_13_arg_1=0, init_15_arg_1=0, init_18_arg_1=0, init_9_arg_1=0, input_2=0, mask_SORT_1=4294967295, mask_SORT_3=1, msb_SORT_1=2147483648, msb_SORT_3=1, state_12=0, state_14=0, state_17=0, state_8=0, var_10=255, var_10_arg_0=0, var_11=0, var_16=0, var_16_arg_0=0, var_16_arg_1=0, var_16_arg_2=0, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_19_arg_2=0, var_20=1, var_20_arg_0=0, var_20_arg_1=0, var_21_arg_0=255, var_21_arg_1=1, var_24=1, var_7=0] [L79] EXPR var_21_arg_0 | var_21_arg_1 VAL [init_13_arg_1=0, init_15_arg_1=0, init_18_arg_1=0, init_9_arg_1=0, input_2=0, mask_SORT_1=4294967295, mask_SORT_3=1, msb_SORT_1=2147483648, msb_SORT_3=1, state_12=0, state_14=0, state_17=0, state_8=0, var_10=255, var_10_arg_0=0, var_11=0, var_16=0, var_16_arg_0=0, var_16_arg_1=0, var_16_arg_2=0, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_19_arg_2=0, var_20=1, var_20_arg_0=0, var_20_arg_1=0, var_21_arg_0=255, var_21_arg_1=1, var_24=1, var_7=0] [L79] SORT_3 var_21 = var_21_arg_0 | var_21_arg_1; [L80] SORT_3 var_25_arg_0 = var_21; [L81] SORT_3 var_25 = ~var_25_arg_0; [L82] SORT_3 var_26_arg_0 = var_24; [L83] SORT_3 var_26_arg_1 = var_25; VAL [init_13_arg_1=0, init_15_arg_1=0, init_18_arg_1=0, init_9_arg_1=0, input_2=0, mask_SORT_1=4294967295, mask_SORT_3=1, msb_SORT_1=2147483648, msb_SORT_3=1, state_12=0, state_14=0, state_17=0, state_8=0, var_10=255, var_10_arg_0=0, var_11=0, var_16=0, var_16_arg_0=0, var_16_arg_1=0, var_16_arg_2=0, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_19_arg_2=0, var_20=1, var_20_arg_0=0, var_20_arg_1=0, var_21=0, var_21_arg_0=255, var_21_arg_1=1, var_24=1, var_25=255, var_25_arg_0=0, var_26_arg_0=1, var_26_arg_1=255, var_7=0] [L84] EXPR var_26_arg_0 & var_26_arg_1 VAL [init_13_arg_1=0, init_15_arg_1=0, init_18_arg_1=0, init_9_arg_1=0, input_2=0, mask_SORT_1=4294967295, mask_SORT_3=1, msb_SORT_1=2147483648, msb_SORT_3=1, state_12=0, state_14=0, state_17=0, state_8=0, var_10=255, var_10_arg_0=0, var_11=0, var_16=0, var_16_arg_0=0, var_16_arg_1=0, var_16_arg_2=0, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_19_arg_2=0, var_20=1, var_20_arg_0=0, var_20_arg_1=0, var_21=0, var_21_arg_0=255, var_21_arg_1=1, var_24=1, var_25=255, var_25_arg_0=0, var_26_arg_0=1, var_26_arg_1=255, var_7=0] [L84] SORT_3 var_26 = var_26_arg_0 & var_26_arg_1; [L85] EXPR var_26 & mask_SORT_3 VAL [init_13_arg_1=0, init_15_arg_1=0, init_18_arg_1=0, init_9_arg_1=0, input_2=0, mask_SORT_1=4294967295, mask_SORT_3=1, msb_SORT_1=2147483648, msb_SORT_3=1, state_12=0, state_14=0, state_17=0, state_8=0, var_10=255, var_10_arg_0=0, var_11=0, var_16=0, var_16_arg_0=0, var_16_arg_1=0, var_16_arg_2=0, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_19_arg_2=0, var_20=1, var_20_arg_0=0, var_20_arg_1=0, var_21=0, var_21_arg_0=255, var_21_arg_1=1, var_24=1, var_25=255, var_25_arg_0=0, var_26=1, var_26_arg_0=1, var_26_arg_1=255, var_7=0] [L85] var_26 = var_26 & mask_SORT_3 [L86] SORT_3 bad_27_arg_0 = var_26; [L87] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 840 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 840 mSDsluCounter, 1324 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 994 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 226 IncrementalHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 330 mSDtfsCounter, 226 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=5, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 126 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 489 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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: unable to determine feasibility of some traces [2023-12-25 16:00:41,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...