/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.vcegar_QF_BV_itc99_b13_p05.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 22:59:02,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 22:59:02,660 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 22:59:02,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 22:59:02,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 22:59:02,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 22:59:02,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 22:59:02,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 22:59:02,694 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 22:59:02,697 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 22:59:02,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 22:59:02,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 22:59:02,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 22:59:02,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 22:59:02,700 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 22:59:02,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 22:59:02,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 22:59:02,700 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-25 22:59:02,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 22:59:02,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 22:59:02,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 22:59:02,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 22:59:02,702 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 22:59:02,703 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 22:59:02,703 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 22:59:02,703 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 22:59:02,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 22:59:02,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 22:59:02,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 22:59:02,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 22:59:02,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 22:59:02,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 22:59:02,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 22:59:02,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-25 22:59:02,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-25 22:59:02,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 22:59:02,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 22:59:02,706 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 22:59:02,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 22:59:02,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 22:59:02,706 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 22:59:02,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 22:59:02,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 22:59:02,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 22:59:02,963 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 22:59:02,963 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 22:59:02,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p05.c [2023-12-25 22:59:04,183 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 22:59:04,383 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 22:59:04,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p05.c [2023-12-25 22:59:04,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92022c298/7c67b905d2fd4bb0970648610401ac1e/FLAGa3ad784bd [2023-12-25 22:59:04,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92022c298/7c67b905d2fd4bb0970648610401ac1e [2023-12-25 22:59:04,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 22:59:04,411 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 22:59:04,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 22:59:04,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 22:59:04,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 22:59:04,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 10:59:04" (1/1) ... [2023-12-25 22:59:04,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a60b913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:59:04, skipping insertion in model container [2023-12-25 22:59:04,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 10:59:04" (1/1) ... [2023-12-25 22:59:04,451 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 22:59:04,595 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.vcegar_QF_BV_itc99_b13_p05.c[1266,1279] [2023-12-25 22:59:04,650 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 22:59:04,668 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 22:59:04,682 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.vcegar_QF_BV_itc99_b13_p05.c[1266,1279] [2023-12-25 22:59:04,713 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 22:59:04,725 INFO L206 MainTranslator]: Completed translation [2023-12-25 22:59:04,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:59:04 WrapperNode [2023-12-25 22:59:04,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 22:59:04,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 22:59:04,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 22:59:04,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 22:59:04,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:59:04" (1/1) ... [2023-12-25 22:59:04,742 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:59:04" (1/1) ... [2023-12-25 22:59:04,782 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 259 [2023-12-25 22:59:04,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 22:59:04,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 22:59:04,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 22:59:04,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 22:59:04,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:59:04" (1/1) ... [2023-12-25 22:59:04,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:59:04" (1/1) ... [2023-12-25 22:59:04,798 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:59:04" (1/1) ... [2023-12-25 22:59:04,814 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 22:59:04,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:59:04" (1/1) ... [2023-12-25 22:59:04,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:59:04" (1/1) ... [2023-12-25 22:59:04,823 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:59:04" (1/1) ... [2023-12-25 22:59:04,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:59:04" (1/1) ... [2023-12-25 22:59:04,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:59:04" (1/1) ... [2023-12-25 22:59:04,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:59:04" (1/1) ... [2023-12-25 22:59:04,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 22:59:04,834 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 22:59:04,834 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 22:59:04,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 22:59:04,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:59:04" (1/1) ... [2023-12-25 22:59:04,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 22:59:04,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 22:59:04,862 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 22:59:04,880 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 22:59:04,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 22:59:04,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-25 22:59:04,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 22:59:04,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 22:59:05,001 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 22:59:05,004 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 22:59:05,308 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 22:59:05,336 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 22:59:05,337 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 22:59:05,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 10:59:05 BoogieIcfgContainer [2023-12-25 22:59:05,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 22:59:05,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 22:59:05,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 22:59:05,342 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 22:59:05,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 10:59:04" (1/3) ... [2023-12-25 22:59:05,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37399dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 10:59:05, skipping insertion in model container [2023-12-25 22:59:05,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:59:04" (2/3) ... [2023-12-25 22:59:05,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37399dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 10:59:05, skipping insertion in model container [2023-12-25 22:59:05,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 10:59:05" (3/3) ... [2023-12-25 22:59:05,345 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p05.c [2023-12-25 22:59:05,360 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 22:59:05,360 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 22:59:05,409 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 22:59:05,415 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;@c17e9cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 22:59:05,416 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 22:59:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 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 22:59:05,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-25 22:59:05,424 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 22:59:05,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 22:59:05,425 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 22:59:05,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 22:59:05,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1027960297, now seen corresponding path program 1 times [2023-12-25 22:59:05,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 22:59:05,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135761081] [2023-12-25 22:59:05,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 22:59:05,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 22:59:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 22:59:05,856 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 22:59:05,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 22:59:05,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135761081] [2023-12-25 22:59:05,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135761081] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 22:59:05,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 22:59:05,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 22:59:05,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744289059] [2023-12-25 22:59:05,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 22:59:05,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 22:59:05,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 22:59:05,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 22:59:05,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 22:59:05,888 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 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.5) 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 22:59:05,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 22:59:05,936 INFO L93 Difference]: Finished difference Result 54 states and 86 transitions. [2023-12-25 22:59:05,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 22:59:05,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) 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 22:59:05,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 22:59:05,945 INFO L225 Difference]: With dead ends: 54 [2023-12-25 22:59:05,945 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 22:59:05,947 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 22:59:05,952 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 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 22:59:05,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 22:59:05,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 22:59:05,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-25 22:59:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 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 22:59:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 48 transitions. [2023-12-25 22:59:05,980 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 48 transitions. Word has length 14 [2023-12-25 22:59:05,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 22:59:05,980 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 48 transitions. [2023-12-25 22:59:05,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) 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 22:59:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 48 transitions. [2023-12-25 22:59:05,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-25 22:59:05,983 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 22:59:05,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 22:59:05,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-25 22:59:05,983 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 22:59:05,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 22:59:05,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1803723143, now seen corresponding path program 1 times [2023-12-25 22:59:05,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 22:59:05,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158854554] [2023-12-25 22:59:05,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 22:59:05,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 22:59:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 22:59:06,153 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 22:59:06,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 22:59:06,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158854554] [2023-12-25 22:59:06,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158854554] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 22:59:06,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 22:59:06,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 22:59:06,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962287842] [2023-12-25 22:59:06,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 22:59:06,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 22:59:06,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 22:59:06,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 22:59:06,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 22:59:06,161 INFO L87 Difference]: Start difference. First operand 32 states and 48 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 22:59:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 22:59:06,195 INFO L93 Difference]: Finished difference Result 57 states and 84 transitions. [2023-12-25 22:59:06,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 22:59:06,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2023-12-25 22:59:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 22:59:06,198 INFO L225 Difference]: With dead ends: 57 [2023-12-25 22:59:06,198 INFO L226 Difference]: Without dead ends: 35 [2023-12-25 22:59:06,198 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 22:59:06,199 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 122 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 22:59:06,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 122 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 22:59:06,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-25 22:59:06,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2023-12-25 22:59:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 33 states have internal predecessors, (50), 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 22:59:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2023-12-25 22:59:06,210 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 15 [2023-12-25 22:59:06,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 22:59:06,210 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2023-12-25 22:59:06,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 22:59:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2023-12-25 22:59:06,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-25 22:59:06,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 22:59:06,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 22:59:06,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-25 22:59:06,211 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 22:59:06,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 22:59:06,212 INFO L85 PathProgramCache]: Analyzing trace with hash -129589821, now seen corresponding path program 1 times [2023-12-25 22:59:06,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 22:59:06,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81588479] [2023-12-25 22:59:06,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 22:59:06,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 22:59:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 22:59:06,459 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 22:59:06,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 22:59:06,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81588479] [2023-12-25 22:59:06,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81588479] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 22:59:06,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 22:59:06,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 22:59:06,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376582421] [2023-12-25 22:59:06,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 22:59:06,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 22:59:06,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 22:59:06,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 22:59:06,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 22:59:06,462 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 22:59:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 22:59:06,487 INFO L93 Difference]: Finished difference Result 57 states and 83 transitions. [2023-12-25 22:59:06,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 22:59:06,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2023-12-25 22:59:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 22:59:06,488 INFO L225 Difference]: With dead ends: 57 [2023-12-25 22:59:06,488 INFO L226 Difference]: Without dead ends: 33 [2023-12-25 22:59:06,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 22:59:06,489 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 63 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 22:59:06,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 22:59:06,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-25 22:59:06,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-12-25 22:59:06,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 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 22:59:06,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2023-12-25 22:59:06,496 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 16 [2023-12-25 22:59:06,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 22:59:06,496 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2023-12-25 22:59:06,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 22:59:06,496 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2023-12-25 22:59:06,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-25 22:59:06,497 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 22:59:06,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 22:59:06,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-25 22:59:06,497 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 22:59:06,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 22:59:06,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1645417541, now seen corresponding path program 1 times [2023-12-25 22:59:06,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 22:59:06,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619794048] [2023-12-25 22:59:06,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 22:59:06,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 22:59:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 22:59:06,525 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 22:59:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 22:59:06,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-25 22:59:06,581 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 22:59:06,581 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 22:59:06,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-25 22:59:06,584 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-25 22:59:06,587 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 22:59:06,609 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-25 22:59:06,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 10:59:06 BoogieIcfgContainer [2023-12-25 22:59:06,616 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 22:59:06,617 INFO L158 Benchmark]: Toolchain (without parser) took 2205.50ms. Allocated memory is still 298.8MB. Free memory was 249.6MB in the beginning and 241.0MB in the end (delta: 8.5MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. [2023-12-25 22:59:06,617 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 196.1MB. Free memory was 149.5MB in the beginning and 149.4MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 22:59:06,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.90ms. Allocated memory is still 298.8MB. Free memory was 249.6MB in the beginning and 236.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 22:59:06,618 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.44ms. Allocated memory is still 298.8MB. Free memory was 236.4MB in the beginning and 232.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-25 22:59:06,618 INFO L158 Benchmark]: Boogie Preprocessor took 50.17ms. Allocated memory is still 298.8MB. Free memory was 232.2MB in the beginning and 229.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 22:59:06,619 INFO L158 Benchmark]: RCFGBuilder took 502.96ms. Allocated memory is still 298.8MB. Free memory was 229.1MB in the beginning and 205.5MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-25 22:59:06,619 INFO L158 Benchmark]: TraceAbstraction took 1277.12ms. Allocated memory is still 298.8MB. Free memory was 205.0MB in the beginning and 241.0MB in the end (delta: -36.1MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 22:59:06,628 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.11ms. Allocated memory is still 196.1MB. Free memory was 149.5MB in the beginning and 149.4MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 310.90ms. Allocated memory is still 298.8MB. Free memory was 249.6MB in the beginning and 236.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.44ms. Allocated memory is still 298.8MB. Free memory was 236.4MB in the beginning and 232.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.17ms. Allocated memory is still 298.8MB. Free memory was 232.2MB in the beginning and 229.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 502.96ms. Allocated memory is still 298.8MB. Free memory was 229.1MB in the beginning and 205.5MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1277.12ms. Allocated memory is still 298.8MB. Free memory was 205.0MB in the beginning and 241.0MB in the end (delta: -36.1MB). There was no memory consumed. 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 114. 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_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 4); [L33] const SORT_7 msb_SORT_7 = (SORT_7)1 << (4 - 1); [L35] const SORT_62 mask_SORT_62 = (SORT_62)-1 >> (sizeof(SORT_62) * 8 - 10); [L36] const SORT_62 msb_SORT_62 = (SORT_62)1 << (10 - 1); [L38] const SORT_7 var_8 = 0; [L39] const SORT_1 var_16 = 1; [L40] const SORT_1 var_20 = 0; [L42] SORT_1 input_2; [L43] SORT_3 input_4; [L44] SORT_1 input_5; [L45] SORT_1 input_6; [L46] SORT_1 input_23; [L47] SORT_1 input_25; [L48] SORT_1 input_27; [L49] SORT_1 input_29; [L50] SORT_1 input_31; [L51] SORT_1 input_33; [L52] SORT_1 input_35; [L53] SORT_1 input_37; [L54] SORT_1 input_39; [L55] SORT_1 input_41; [L56] SORT_1 input_43; [L57] SORT_3 input_45; [L58] SORT_1 input_48; [L59] SORT_1 input_50; [L60] SORT_1 input_52; [L61] SORT_1 input_54; [L62] SORT_1 input_56; [L63] SORT_1 input_58; [L64] SORT_1 input_60; [L65] SORT_62 input_63; [L66] SORT_1 input_65; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_62=1023, mask_SORT_7=15, msb_SORT_1=1, msb_SORT_3=128, msb_SORT_62=512, msb_SORT_7=8, var_16=1, var_20=0, var_8=0] [L68] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_62=1023, mask_SORT_7=15, msb_SORT_1=1, msb_SORT_3=128, msb_SORT_62=512, msb_SORT_7=8, state_9=0, var_16=1, var_20=0, var_8=0] [L69] SORT_7 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_62=1023, mask_SORT_7=15, msb_SORT_1=1, msb_SORT_3=128, msb_SORT_62=512, msb_SORT_7=8, state_11=0, state_9=0, var_16=1, var_20=0, var_8=0] [L70] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] SORT_7 init_10_arg_1 = var_8; [L73] state_9 = init_10_arg_1 [L74] SORT_7 init_12_arg_1 = var_8; [L75] state_11 = init_12_arg_1 [L76] SORT_1 init_22_arg_1 = var_20; [L77] state_21 = init_22_arg_1 VAL [init_10_arg_1=0, init_12_arg_1=0, init_22_arg_1=0, mask_SORT_1=1, mask_SORT_3=255, mask_SORT_62=1023, mask_SORT_7=15, msb_SORT_1=1, msb_SORT_3=128, msb_SORT_62=512, msb_SORT_7=8, state_11=0, state_21=0, state_9=0, var_16=1, var_20=0, var_8=0] [L80] input_2 = __VERIFIER_nondet_uchar() [L81] input_4 = __VERIFIER_nondet_uchar() [L82] input_5 = __VERIFIER_nondet_uchar() [L83] input_6 = __VERIFIER_nondet_uchar() [L84] input_23 = __VERIFIER_nondet_uchar() [L85] input_25 = __VERIFIER_nondet_uchar() [L86] input_27 = __VERIFIER_nondet_uchar() [L87] input_29 = __VERIFIER_nondet_uchar() [L88] input_31 = __VERIFIER_nondet_uchar() [L89] input_33 = __VERIFIER_nondet_uchar() [L90] input_35 = __VERIFIER_nondet_uchar() [L91] input_37 = __VERIFIER_nondet_uchar() [L92] input_39 = __VERIFIER_nondet_uchar() [L93] input_41 = __VERIFIER_nondet_uchar() [L94] input_43 = __VERIFIER_nondet_uchar() [L95] input_45 = __VERIFIER_nondet_uchar() [L96] input_48 = __VERIFIER_nondet_uchar() [L97] input_50 = __VERIFIER_nondet_uchar() [L98] input_52 = __VERIFIER_nondet_uchar() [L99] input_54 = __VERIFIER_nondet_uchar() [L100] input_56 = __VERIFIER_nondet_uchar() [L101] input_58 = __VERIFIER_nondet_uchar() [L102] input_60 = __VERIFIER_nondet_uchar() [L103] input_63 = __VERIFIER_nondet_ushort() [L104] input_65 = __VERIFIER_nondet_uchar() [L107] SORT_7 var_13_arg_0 = state_9; [L108] SORT_7 var_13_arg_1 = state_11; [L109] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L110] SORT_1 var_17_arg_0 = var_13; [L111] SORT_1 var_17 = ~var_17_arg_0; [L112] SORT_1 var_18_arg_0 = var_16; [L113] SORT_1 var_18_arg_1 = var_17; VAL [init_10_arg_1=0, init_12_arg_1=0, init_22_arg_1=0, mask_SORT_1=1, mask_SORT_3=255, mask_SORT_62=1023, mask_SORT_7=15, msb_SORT_1=1, msb_SORT_3=128, msb_SORT_62=512, msb_SORT_7=8, state_11=0, state_21=0, state_9=0, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_16=1, var_17=254, var_17_arg_0=1, var_18_arg_0=1, var_18_arg_1=254, var_20=0, var_8=0] [L114] EXPR var_18_arg_0 & var_18_arg_1 VAL [init_10_arg_1=0, init_12_arg_1=0, init_22_arg_1=0, mask_SORT_1=1, mask_SORT_3=255, mask_SORT_62=1023, mask_SORT_7=15, msb_SORT_1=1, msb_SORT_3=128, msb_SORT_62=512, msb_SORT_7=8, state_11=0, state_21=0, state_9=0, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_16=1, var_17=254, var_17_arg_0=1, var_18_arg_0=1, var_18_arg_1=254, var_20=0, var_8=0] [L114] SORT_1 var_18 = var_18_arg_0 & var_18_arg_1; [L115] EXPR var_18 & mask_SORT_1 VAL [init_10_arg_1=0, init_12_arg_1=0, init_22_arg_1=0, mask_SORT_1=1, mask_SORT_3=255, mask_SORT_62=1023, mask_SORT_7=15, msb_SORT_1=1, msb_SORT_3=128, msb_SORT_62=512, msb_SORT_7=8, state_11=0, state_21=0, state_9=0, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_16=1, var_17=254, var_17_arg_0=1, var_18=1, var_18_arg_0=1, var_18_arg_1=254, var_20=0, var_8=0] [L115] var_18 = var_18 & mask_SORT_1 [L116] SORT_1 bad_19_arg_0 = var_18; [L117] CALL __VERIFIER_assert(!(bad_19_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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 300 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 175 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 125 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=2, InterpolantAutomatonStates: 12, 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, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 95 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 22:59:06,652 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...