/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.counter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 17:38:09,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 17:38:10,032 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 17:38:10,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 17:38:10,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 17:38:10,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 17:38:10,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 17:38:10,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 17:38:10,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 17:38:10,063 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 17:38:10,063 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 17:38:10,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 17:38:10,064 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 17:38:10,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 17:38:10,065 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 17:38:10,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 17:38:10,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 17:38:10,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-25 17:38:10,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 17:38:10,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 17:38:10,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 17:38:10,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 17:38:10,067 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 17:38:10,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 17:38:10,068 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 17:38:10,068 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 17:38:10,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 17:38:10,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 17:38:10,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 17:38:10,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 17:38:10,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 17:38:10,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 17:38:10,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 17:38:10,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-25 17:38:10,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-25 17:38:10,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 17:38:10,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 17:38:10,070 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 17:38:10,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 17:38:10,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 17:38:10,071 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 17:38:10,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 17:38:10,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 17:38:10,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 17:38:10,287 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 17:38:10,288 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 17:38:10,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.counter.c [2023-12-25 17:38:11,284 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 17:38:11,451 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 17:38:11,451 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.counter.c [2023-12-25 17:38:11,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4812a2031/45a785e0456e47abb199a5b18f73be10/FLAGe047c85da [2023-12-25 17:38:11,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4812a2031/45a785e0456e47abb199a5b18f73be10 [2023-12-25 17:38:11,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 17:38:11,476 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 17:38:11,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 17:38:11,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 17:38:11,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 17:38:11,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:38:11" (1/1) ... [2023-12-25 17:38:11,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@624c2696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:38:11, skipping insertion in model container [2023-12-25 17:38:11,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:38:11" (1/1) ... [2023-12-25 17:38:11,504 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 17:38:11,625 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.counter.c[1247,1260] [2023-12-25 17:38:11,647 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 17:38:11,654 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 17:38:11,661 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.counter.c[1247,1260] [2023-12-25 17:38:11,674 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 17:38:11,683 INFO L206 MainTranslator]: Completed translation [2023-12-25 17:38:11,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:38:11 WrapperNode [2023-12-25 17:38:11,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 17:38:11,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 17:38:11,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 17:38:11,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 17:38:11,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:38:11" (1/1) ... [2023-12-25 17:38:11,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:38:11" (1/1) ... [2023-12-25 17:38:11,743 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 121 [2023-12-25 17:38:11,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 17:38:11,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 17:38:11,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 17:38:11,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 17:38:11,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:38:11" (1/1) ... [2023-12-25 17:38:11,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:38:11" (1/1) ... [2023-12-25 17:38:11,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:38:11" (1/1) ... [2023-12-25 17:38:11,783 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 17:38:11,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:38:11" (1/1) ... [2023-12-25 17:38:11,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:38:11" (1/1) ... [2023-12-25 17:38:11,788 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:38:11" (1/1) ... [2023-12-25 17:38:11,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:38:11" (1/1) ... [2023-12-25 17:38:11,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:38:11" (1/1) ... [2023-12-25 17:38:11,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:38:11" (1/1) ... [2023-12-25 17:38:11,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 17:38:11,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 17:38:11,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 17:38:11,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 17:38:11,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:38:11" (1/1) ... [2023-12-25 17:38:11,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 17:38:11,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 17:38:11,834 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 17:38:11,852 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 17:38:11,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 17:38:11,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-25 17:38:11,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 17:38:11,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 17:38:11,917 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 17:38:11,918 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 17:38:12,137 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 17:38:12,152 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 17:38:12,152 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 17:38:12,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:38:12 BoogieIcfgContainer [2023-12-25 17:38:12,153 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 17:38:12,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 17:38:12,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 17:38:12,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 17:38:12,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 05:38:11" (1/3) ... [2023-12-25 17:38:12,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20722c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:38:12, skipping insertion in model container [2023-12-25 17:38:12,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:38:11" (2/3) ... [2023-12-25 17:38:12,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20722c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:38:12, skipping insertion in model container [2023-12-25 17:38:12,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:38:12" (3/3) ... [2023-12-25 17:38:12,158 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.counter.c [2023-12-25 17:38:12,171 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 17:38:12,171 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 17:38:12,201 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 17:38:12,206 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;@20e1510e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 17:38:12,206 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 17:38:12,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 22 states have internal predecessors, (35), 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 17:38:12,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-25 17:38:12,212 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:38:12,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 17:38:12,213 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:38:12,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:38:12,217 INFO L85 PathProgramCache]: Analyzing trace with hash 313020817, now seen corresponding path program 1 times [2023-12-25 17:38:12,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:38:12,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89314552] [2023-12-25 17:38:12,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:38:12,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:38:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:38:12,508 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 17:38:12,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:38:12,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89314552] [2023-12-25 17:38:12,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89314552] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:38:12,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:38:12,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 17:38:12,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977393915] [2023-12-25 17:38:12,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:38:12,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 17:38:12,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:38:12,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 17:38:12,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 17:38:12,544 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 22 states have internal predecessors, (35), 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 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 17:38:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:38:12,578 INFO L93 Difference]: Finished difference Result 42 states and 66 transitions. [2023-12-25 17:38:12,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:38:12,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2023-12-25 17:38:12,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:38:12,585 INFO L225 Difference]: With dead ends: 42 [2023-12-25 17:38:12,585 INFO L226 Difference]: Without dead ends: 23 [2023-12-25 17:38:12,586 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 17:38:12,589 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 79 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 17:38:12,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 79 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:38:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-25 17:38:12,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-25 17:38:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 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-25 17:38:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2023-12-25 17:38:12,609 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 12 [2023-12-25 17:38:12,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:38:12,610 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2023-12-25 17:38:12,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 17:38:12,610 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2023-12-25 17:38:12,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-25 17:38:12,610 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:38:12,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 17:38:12,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-25 17:38:12,611 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:38:12,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:38:12,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1115435731, now seen corresponding path program 1 times [2023-12-25 17:38:12,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:38:12,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927440660] [2023-12-25 17:38:12,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:38:12,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:38:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:38:12,688 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 17:38:12,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:38:12,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927440660] [2023-12-25 17:38:12,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927440660] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:38:12,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:38:12,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 17:38:12,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459924781] [2023-12-25 17:38:12,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:38:12,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 17:38:12,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:38:12,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 17:38:12,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 17:38:12,690 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-25 17:38:12,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:38:12,711 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2023-12-25 17:38:12,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 17:38:12,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) Word has length 13 [2023-12-25 17:38:12,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:38:12,712 INFO L225 Difference]: With dead ends: 45 [2023-12-25 17:38:12,712 INFO L226 Difference]: Without dead ends: 26 [2023-12-25 17:38:12,713 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 17:38:12,714 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 77 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 17:38:12,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 77 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:38:12,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-25 17:38:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-12-25 17:38:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 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 17:38:12,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2023-12-25 17:38:12,717 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 13 [2023-12-25 17:38:12,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:38:12,717 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2023-12-25 17:38:12,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-25 17:38:12,717 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2023-12-25 17:38:12,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-25 17:38:12,718 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:38:12,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 17:38:12,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-25 17:38:12,718 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:38:12,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:38:12,718 INFO L85 PathProgramCache]: Analyzing trace with hash 8336875, now seen corresponding path program 1 times [2023-12-25 17:38:12,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:38:12,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082231509] [2023-12-25 17:38:12,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:38:12,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:38:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 17:38:12,898 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 17:38:12,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 17:38:12,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082231509] [2023-12-25 17:38:12,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082231509] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 17:38:12,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 17:38:12,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 17:38:12,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817171608] [2023-12-25 17:38:12,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 17:38:12,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 17:38:12,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 17:38:12,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 17:38:12,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 17:38:12,901 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 17:38:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 17:38:12,979 INFO L93 Difference]: Finished difference Result 63 states and 89 transitions. [2023-12-25 17:38:12,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 17:38:12,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2023-12-25 17:38:12,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 17:38:12,982 INFO L225 Difference]: With dead ends: 63 [2023-12-25 17:38:12,982 INFO L226 Difference]: Without dead ends: 42 [2023-12-25 17:38:12,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-25 17:38:12,986 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 107 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 17:38:12,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 59 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 17:38:12,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-25 17:38:12,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 23. [2023-12-25 17:38:12,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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 17:38:12,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2023-12-25 17:38:12,991 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2023-12-25 17:38:12,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 17:38:12,991 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2023-12-25 17:38:12,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 17:38:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2023-12-25 17:38:12,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-25 17:38:12,995 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 17:38:12,995 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 17:38:12,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-25 17:38:12,995 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 17:38:12,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 17:38:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1783344237, now seen corresponding path program 1 times [2023-12-25 17:38:12,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 17:38:12,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033941208] [2023-12-25 17:38:12,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 17:38:12,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 17:38:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 17:38:13,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 17:38:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 17:38:13,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-25 17:38:13,064 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 17:38:13,065 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 17:38:13,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-25 17:38:13,068 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-25 17:38:13,070 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 17:38:13,090 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-25 17:38:13,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 05:38:13 BoogieIcfgContainer [2023-12-25 17:38:13,103 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 17:38:13,104 INFO L158 Benchmark]: Toolchain (without parser) took 1627.36ms. Allocated memory is still 254.8MB. Free memory was 198.8MB in the beginning and 115.1MB in the end (delta: 83.8MB). Peak memory consumption was 84.3MB. Max. memory is 8.0GB. [2023-12-25 17:38:13,104 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 186.6MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 17:38:13,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.19ms. Allocated memory is still 254.8MB. Free memory was 198.5MB in the beginning and 186.8MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 17:38:13,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.01ms. Allocated memory is still 254.8MB. Free memory was 186.8MB in the beginning and 183.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 17:38:13,106 INFO L158 Benchmark]: Boogie Preprocessor took 62.15ms. Allocated memory is still 254.8MB. Free memory was 183.7MB in the beginning and 181.0MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 17:38:13,106 INFO L158 Benchmark]: RCFGBuilder took 346.00ms. Allocated memory is still 254.8MB. Free memory was 181.0MB in the beginning and 216.8MB in the end (delta: -35.8MB). Peak memory consumption was 20.4MB. Max. memory is 8.0GB. [2023-12-25 17:38:13,107 INFO L158 Benchmark]: TraceAbstraction took 948.78ms. Allocated memory is still 254.8MB. Free memory was 215.7MB in the beginning and 115.1MB in the end (delta: 100.7MB). Peak memory consumption was 100.7MB. Max. memory is 8.0GB. [2023-12-25 17:38:13,108 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.08ms. Allocated memory is still 186.6MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.19ms. Allocated memory is still 254.8MB. Free memory was 198.5MB in the beginning and 186.8MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.01ms. Allocated memory is still 254.8MB. Free memory was 186.8MB in the beginning and 183.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.15ms. Allocated memory is still 254.8MB. Free memory was 183.7MB in the beginning and 181.0MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 346.00ms. Allocated memory is still 254.8MB. Free memory was 181.0MB in the beginning and 216.8MB in the end (delta: -35.8MB). Peak memory consumption was 20.4MB. Max. memory is 8.0GB. * TraceAbstraction took 948.78ms. Allocated memory is still 254.8MB. Free memory was 215.7MB in the beginning and 115.1MB in the end (delta: 100.7MB). Peak memory consumption was 100.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 bitwiseAnd at line 58. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_4 var_5 = 1; [L33] const SORT_4 var_8 = 0; [L34] const SORT_1 var_12 = 1; [L35] const SORT_4 var_18 = 15; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, var_12=1, var_18=15, var_5=1, var_8=0] [L40] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L42] SORT_4 init_7_arg_1 = var_5; [L43] state_6 = init_7_arg_1 VAL [init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, state_6=1, var_12=1, var_18=15, var_5=1, var_8=0] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_3 = __VERIFIER_nondet_uchar() [L48] EXPR input_3 & mask_SORT_1 VAL [init_7_arg_1=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, state_6=1, var_12=1, var_18=15, var_5=1, var_8=0] [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_4 var_9_arg_0 = state_6; [L52] SORT_4 var_9_arg_1 = var_8; [L53] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L54] SORT_1 var_13_arg_0 = var_9; [L55] SORT_1 var_13 = ~var_13_arg_0; [L56] SORT_1 var_14_arg_0 = var_12; [L57] SORT_1 var_14_arg_1 = var_13; VAL [init_7_arg_1=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, state_6=1, var_12=1, var_13=254, var_13_arg_0=1, var_14_arg_0=1, var_14_arg_1=254, var_18=15, var_5=1, var_8=0, var_9=1, var_9_arg_0=1, var_9_arg_1=0] [L58] EXPR var_14_arg_0 & var_14_arg_1 VAL [init_7_arg_1=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, state_6=1, var_12=1, var_13=254, var_13_arg_0=1, var_14_arg_0=1, var_14_arg_1=254, var_18=15, var_5=1, var_8=0, var_9=1, var_9_arg_0=1, var_9_arg_1=0] [L58] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L59] EXPR var_14 & mask_SORT_1 VAL [init_7_arg_1=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, state_6=1, var_12=1, var_13=254, var_13_arg_0=1, var_14=1, var_14_arg_0=1, var_14_arg_1=254, var_18=15, var_5=1, var_8=0, var_9=1, var_9_arg_0=1, var_9_arg_1=0] [L59] var_14 = var_14 & mask_SORT_1 [L60] SORT_1 bad_15_arg_0 = var_14; [L61] CALL __VERIFIER_assert(!(bad_15_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, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 109 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 215 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 84 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 17:38:13,123 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...