/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.bug-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 15:09:43,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 15:09:43,553 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 15:09:43,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 15:09:43,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 15:09:43,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 15:09:43,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 15:09:43,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 15:09:43,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 15:09:43,589 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 15:09:43,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 15:09:43,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 15:09:43,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 15:09:43,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 15:09:43,592 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 15:09:43,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 15:09:43,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 15:09:43,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-25 15:09:43,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 15:09:43,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 15:09:43,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 15:09:43,594 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 15:09:43,594 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 15:09:43,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 15:09:43,595 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 15:09:43,595 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 15:09:43,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 15:09:43,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 15:09:43,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 15:09:43,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 15:09:43,597 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 15:09:43,597 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 15:09:43,597 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 15:09:43,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-25 15:09:43,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-25 15:09:43,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 15:09:43,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 15:09:43,598 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 15:09:43,598 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 15:09:43,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 15:09:43,598 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 15:09:43,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 15:09:43,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 15:09:43,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 15:09:43,834 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 15:09:43,834 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 15:09:43,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.bug-1.c [2023-12-25 15:09:44,932 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 15:09:45,098 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 15:09:45,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.bug-1.c [2023-12-25 15:09:45,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40fe9b5ed/4936fcf17cd1435d8e5c862aab5209df/FLAGfe53518e6 [2023-12-25 15:09:45,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40fe9b5ed/4936fcf17cd1435d8e5c862aab5209df [2023-12-25 15:09:45,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 15:09:45,118 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 15:09:45,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 15:09:45,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 15:09:45,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 15:09:45,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:09:45" (1/1) ... [2023-12-25 15:09:45,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a7f11f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:09:45, skipping insertion in model container [2023-12-25 15:09:45,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:09:45" (1/1) ... [2023-12-25 15:09:45,153 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 15:09:45,285 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.bug-1.c[1245,1258] [2023-12-25 15:09:45,313 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 15:09:45,327 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 15:09:45,336 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.bug-1.c[1245,1258] [2023-12-25 15:09:45,352 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 15:09:45,362 INFO L206 MainTranslator]: Completed translation [2023-12-25 15:09:45,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:09:45 WrapperNode [2023-12-25 15:09:45,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 15:09:45,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 15:09:45,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 15:09:45,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 15:09:45,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:09:45" (1/1) ... [2023-12-25 15:09:45,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:09:45" (1/1) ... [2023-12-25 15:09:45,413 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 124 [2023-12-25 15:09:45,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 15:09:45,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 15:09:45,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 15:09:45,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 15:09:45,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:09:45" (1/1) ... [2023-12-25 15:09:45,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:09:45" (1/1) ... [2023-12-25 15:09:45,429 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:09:45" (1/1) ... [2023-12-25 15:09:45,449 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-12-25 15:09:45,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:09:45" (1/1) ... [2023-12-25 15:09:45,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:09:45" (1/1) ... [2023-12-25 15:09:45,462 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:09:45" (1/1) ... [2023-12-25 15:09:45,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:09:45" (1/1) ... [2023-12-25 15:09:45,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:09:45" (1/1) ... [2023-12-25 15:09:45,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:09:45" (1/1) ... [2023-12-25 15:09:45,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 15:09:45,487 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 15:09:45,488 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 15:09:45,488 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 15:09:45,489 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:09:45" (1/1) ... [2023-12-25 15:09:45,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 15:09:45,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 15:09:45,523 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 15:09:45,552 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 15:09:45,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 15:09:45,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-25 15:09:45,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-25 15:09:45,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 15:09:45,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 15:09:45,649 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 15:09:45,651 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 15:09:45,872 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 15:09:45,893 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 15:09:45,894 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 15:09:45,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:09:45 BoogieIcfgContainer [2023-12-25 15:09:45,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 15:09:45,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 15:09:45,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 15:09:45,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 15:09:45,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 03:09:45" (1/3) ... [2023-12-25 15:09:45,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4b44d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:09:45, skipping insertion in model container [2023-12-25 15:09:45,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:09:45" (2/3) ... [2023-12-25 15:09:45,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4b44d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:09:45, skipping insertion in model container [2023-12-25 15:09:45,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:09:45" (3/3) ... [2023-12-25 15:09:45,902 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bug-1.c [2023-12-25 15:09:45,918 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 15:09:45,919 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 15:09:45,966 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 15:09:45,971 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;@16c8f954, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 15:09:45,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 15:09:45,975 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 15:09:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-25 15:09:45,980 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 15:09:45,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 15:09:45,981 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 15:09:45,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 15:09:45,986 INFO L85 PathProgramCache]: Analyzing trace with hash 165303482, now seen corresponding path program 1 times [2023-12-25 15:09:45,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 15:09:45,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491703630] [2023-12-25 15:09:45,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 15:09:45,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 15:09:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 15:09:46,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 15:09:46,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 15:09:46,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491703630] [2023-12-25 15:09:46,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491703630] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 15:09:46,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 15:09:46,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 15:09:46,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590474621] [2023-12-25 15:09:46,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 15:09:46,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 15:09:46,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 15:09:46,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 15:09:46,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 15:09:46,554 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.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 15:09:46,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 15:09:46,607 INFO L93 Difference]: Finished difference Result 42 states and 66 transitions. [2023-12-25 15:09:46,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 15:09:46,610 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 15:09:46,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 15:09:46,615 INFO L225 Difference]: With dead ends: 42 [2023-12-25 15:09:46,615 INFO L226 Difference]: Without dead ends: 23 [2023-12-25 15:09:46,617 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 15:09:46,620 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 15:09:46,621 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 15:09:46,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-25 15:09:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-25 15:09:46,644 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 15:09:46,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2023-12-25 15:09:46,646 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 14 [2023-12-25 15:09:46,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 15:09:46,646 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2023-12-25 15:09:46,647 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 15:09:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2023-12-25 15:09:46,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-25 15:09:46,647 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 15:09:46,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 15:09:46,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-25 15:09:46,648 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 15:09:46,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 15:09:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash 831165654, now seen corresponding path program 1 times [2023-12-25 15:09:46,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 15:09:46,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056198487] [2023-12-25 15:09:46,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 15:09:46,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 15:09:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 15:09:46,817 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 15:09:46,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 15:09:46,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056198487] [2023-12-25 15:09:46,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056198487] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 15:09:46,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 15:09:46,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 15:09:46,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114483533] [2023-12-25 15:09:46,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 15:09:46,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 15:09:46,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 15:09:46,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 15:09:46,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 15:09:46,821 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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 15:09:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 15:09:46,989 INFO L93 Difference]: Finished difference Result 81 states and 115 transitions. [2023-12-25 15:09:46,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 15:09:46,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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 15:09:46,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 15:09:46,992 INFO L225 Difference]: With dead ends: 81 [2023-12-25 15:09:46,992 INFO L226 Difference]: Without dead ends: 42 [2023-12-25 15:09:46,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-25 15:09:46,995 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 131 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 15:09:46,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 78 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 15:09:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-25 15:09:47,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2023-12-25 15:09:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 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 15:09:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2023-12-25 15:09:47,006 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2023-12-25 15:09:47,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 15:09:47,006 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2023-12-25 15:09:47,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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 15:09:47,007 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2023-12-25 15:09:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-25 15:09:47,009 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 15:09:47,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 15:09:47,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-25 15:09:47,010 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 15:09:47,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 15:09:47,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2061054446, now seen corresponding path program 1 times [2023-12-25 15:09:47,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 15:09:47,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472782365] [2023-12-25 15:09:47,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 15:09:47,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 15:09:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 15:09:47,127 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 15:09:47,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 15:09:47,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472782365] [2023-12-25 15:09:47,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472782365] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 15:09:47,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 15:09:47,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 15:09:47,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954012066] [2023-12-25 15:09:47,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 15:09:47,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 15:09:47,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 15:09:47,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 15:09:47,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 15:09:47,135 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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 15:09:47,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 15:09:47,162 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2023-12-25 15:09:47,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 15:09:47,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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 15:09:47,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 15:09:47,164 INFO L225 Difference]: With dead ends: 50 [2023-12-25 15:09:47,164 INFO L226 Difference]: Without dead ends: 31 [2023-12-25 15:09:47,165 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 15:09:47,168 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 15:09:47,169 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 15:09:47,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-25 15:09:47,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2023-12-25 15:09:47,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 15:09:47,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2023-12-25 15:09:47,179 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 16 [2023-12-25 15:09:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 15:09:47,180 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2023-12-25 15:09:47,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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 15:09:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2023-12-25 15:09:47,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 15:09:47,188 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 15:09:47,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 15:09:47,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-25 15:09:47,189 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 15:09:47,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 15:09:47,189 INFO L85 PathProgramCache]: Analyzing trace with hash -742254020, now seen corresponding path program 1 times [2023-12-25 15:09:47,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 15:09:47,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334633371] [2023-12-25 15:09:47,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 15:09:47,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 15:09:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 15:09:47,338 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 15:09:47,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-25 15:09:47,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334633371] [2023-12-25 15:09:47,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334633371] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 15:09:47,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 15:09:47,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 15:09:47,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233973228] [2023-12-25 15:09:47,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 15:09:47,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 15:09:47,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-25 15:09:47,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 15:09:47,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 15:09:47,341 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 15:09:47,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 15:09:47,373 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2023-12-25 15:09:47,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 15:09:47,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-25 15:09:47,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 15:09:47,374 INFO L225 Difference]: With dead ends: 51 [2023-12-25 15:09:47,375 INFO L226 Difference]: Without dead ends: 30 [2023-12-25 15:09:47,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 15:09:47,383 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 42 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 15:09:47,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 45 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 15:09:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-25 15:09:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-12-25 15:09:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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 15:09:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-12-25 15:09:47,393 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 17 [2023-12-25 15:09:47,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 15:09:47,393 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-12-25 15:09:47,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 15:09:47,394 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-12-25 15:09:47,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 15:09:47,394 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 15:09:47,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 15:09:47,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-25 15:09:47,395 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 15:09:47,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 15:09:47,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1032753342, now seen corresponding path program 1 times [2023-12-25 15:09:47,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-25 15:09:47,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226982737] [2023-12-25 15:09:47,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 15:09:47,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-25 15:09:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 15:09:47,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 15:09:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 15:09:47,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-25 15:09:47,501 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 15:09:47,502 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 15:09:47,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-25 15:09:47,506 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-25 15:09:47,508 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 15:09:47,524 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-25 15:09:47,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 03:09:47 BoogieIcfgContainer [2023-12-25 15:09:47,531 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 15:09:47,531 INFO L158 Benchmark]: Toolchain (without parser) took 2413.35ms. Allocated memory is still 303.0MB. Free memory was 250.8MB in the beginning and 186.0MB in the end (delta: 64.8MB). Peak memory consumption was 65.2MB. Max. memory is 8.0GB. [2023-12-25 15:09:47,531 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 227.5MB. Free memory is still 177.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 15:09:47,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.11ms. Allocated memory is still 303.0MB. Free memory was 250.8MB in the beginning and 238.9MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 15:09:47,532 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.63ms. Allocated memory is still 303.0MB. Free memory was 238.9MB in the beginning and 235.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 15:09:47,532 INFO L158 Benchmark]: Boogie Preprocessor took 57.47ms. Allocated memory is still 303.0MB. Free memory was 235.8MB in the beginning and 233.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 15:09:47,532 INFO L158 Benchmark]: RCFGBuilder took 406.98ms. Allocated memory is still 303.0MB. Free memory was 233.4MB in the beginning and 215.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-25 15:09:47,533 INFO L158 Benchmark]: TraceAbstraction took 1634.40ms. Allocated memory is still 303.0MB. Free memory was 214.8MB in the beginning and 186.0MB in the end (delta: 28.8MB). Peak memory consumption was 29.6MB. Max. memory is 8.0GB. [2023-12-25 15:09:47,534 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 227.5MB. Free memory is still 177.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.11ms. Allocated memory is still 303.0MB. Free memory was 250.8MB in the beginning and 238.9MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.63ms. Allocated memory is still 303.0MB. Free memory was 238.9MB in the beginning and 235.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.47ms. Allocated memory is still 303.0MB. Free memory was 235.8MB in the beginning and 233.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 406.98ms. Allocated memory is still 303.0MB. Free memory was 233.4MB in the beginning and 215.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 1634.40ms. Allocated memory is still 303.0MB. Free memory was 214.8MB in the beginning and 186.0MB in the end (delta: 28.8MB). Peak memory consumption was 29.6MB. 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 60. 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_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 32); [L30] const SORT_7 msb_SORT_7 = (SORT_7)1 << (32 - 1); [L32] const SORT_1 var_4 = 1; [L33] const SORT_7 var_9 = 1; [L34] const SORT_1 var_17 = 0; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_7=4294967295, msb_SORT_1=1, msb_SORT_7=2147483648, var_17=0, var_4=1, var_9=1] [L39] SORT_1 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L41] SORT_1 init_6_arg_1 = var_4; [L42] state_5 = init_6_arg_1 VAL [init_6_arg_1=1, mask_SORT_1=1, mask_SORT_7=4294967295, msb_SORT_1=1, msb_SORT_7=2147483648, state_5=1, var_17=0, var_4=1, var_9=1] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] EXPR input_3 & mask_SORT_1 VAL [init_6_arg_1=1, input_3=0, mask_SORT_1=1, mask_SORT_7=4294967295, msb_SORT_1=1, msb_SORT_7=2147483648, state_5=1, var_17=0, var_4=1, var_9=1] [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_1 var_8_arg_0 = state_5; VAL [init_6_arg_1=1, input_3=0, mask_SORT_1=1, mask_SORT_7=4294967295, msb_SORT_1=1, msb_SORT_7=2147483648, state_5=1, var_17=0, var_4=1, var_8_arg_0=1, var_9=1] [L51] EXPR var_8_arg_0 & mask_SORT_1 VAL [init_6_arg_1=1, input_3=0, mask_SORT_1=1, mask_SORT_7=4294967295, msb_SORT_1=1, msb_SORT_7=2147483648, state_5=1, var_17=0, var_4=1, var_8_arg_0=1, var_9=1] [L51] var_8_arg_0 = var_8_arg_0 & mask_SORT_1 [L52] SORT_7 var_8 = var_8_arg_0; [L53] SORT_7 var_10_arg_0 = var_8; [L54] SORT_7 var_10_arg_1 = var_9; [L55] SORT_1 var_10 = var_10_arg_0 == var_10_arg_1; [L56] SORT_1 var_13_arg_0 = var_10; [L57] SORT_1 var_13 = ~var_13_arg_0; [L58] SORT_1 var_14_arg_0 = var_4; [L59] SORT_1 var_14_arg_1 = var_13; VAL [init_6_arg_1=1, input_3=0, mask_SORT_1=1, mask_SORT_7=4294967295, msb_SORT_1=1, msb_SORT_7=2147483648, state_5=1, var_10=1, var_10_arg_0=1, var_10_arg_1=1, var_13=254, var_13_arg_0=1, var_14_arg_0=1, var_14_arg_1=254, var_17=0, var_4=1, var_8=1, var_8_arg_0=1, var_9=1] [L60] EXPR var_14_arg_0 & var_14_arg_1 VAL [init_6_arg_1=1, input_3=0, mask_SORT_1=1, mask_SORT_7=4294967295, msb_SORT_1=1, msb_SORT_7=2147483648, state_5=1, var_10=1, var_10_arg_0=1, var_10_arg_1=1, var_13=254, var_13_arg_0=1, var_14_arg_0=1, var_14_arg_1=254, var_17=0, var_4=1, var_8=1, var_8_arg_0=1, var_9=1] [L60] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L61] EXPR var_14 & mask_SORT_1 VAL [init_6_arg_1=1, input_3=0, mask_SORT_1=1, mask_SORT_7=4294967295, msb_SORT_1=1, msb_SORT_7=2147483648, state_5=1, var_10=1, var_10_arg_0=1, var_10_arg_1=1, var_13=254, var_13_arg_0=1, var_14=1, var_14_arg_0=1, var_14_arg_1=254, var_17=0, var_4=1, var_8=1, var_8_arg_0=1, var_9=1] [L61] var_14 = var_14 & mask_SORT_1 [L62] SORT_1 bad_15_arg_0 = var_14; [L63] 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: 1.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 175 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 279 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 87 IncrementalHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 111 mSDtfsCounter, 87 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=3, InterpolantAutomatonStates: 20, 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, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 143 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 15:09:47,550 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...