/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.swap_two.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 19:55:19,672 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 19:55:19,730 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-16 19:55:19,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 19:55:19,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 19:55:19,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 19:55:19,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 19:55:19,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 19:55:19,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 19:55:19,764 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 19:55:19,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 19:55:19,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 19:55:19,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 19:55:19,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 19:55:19,766 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 19:55:19,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 19:55:19,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 19:55:19,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 19:55:19,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 19:55:19,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 19:55:19,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 19:55:19,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 19:55:19,771 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 19:55:19,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 19:55:19,775 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 19:55:19,775 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 19:55:19,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 19:55:19,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 19:55:19,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 19:55:19,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:55:19,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 19:55:19,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 19:55:19,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 19:55:19,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 19:55:19,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 19:55:19,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 19:55:19,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 19:55:19,779 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 19:55:19,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 19:55:19,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 19:55:19,780 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-16 19:55:20,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 19:55:20,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 19:55:20,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 19:55:20,064 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 19:55:20,064 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 19:55:20,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.swap_two.c [2023-12-16 19:55:21,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 19:55:21,450 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 19:55:21,451 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.swap_two.c [2023-12-16 19:55:21,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c412da7/b9fd40d373ef4de7922982393d25180d/FLAGd47615e5c [2023-12-16 19:55:21,467 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c412da7/b9fd40d373ef4de7922982393d25180d [2023-12-16 19:55:21,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 19:55:21,470 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 19:55:21,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 19:55:21,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 19:55:21,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 19:55:21,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:55:21" (1/1) ... [2023-12-16 19:55:21,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c7e8cf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:21, skipping insertion in model container [2023-12-16 19:55:21,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:55:21" (1/1) ... [2023-12-16 19:55:21,501 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 19:55:21,640 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.swap_two.c[1248,1261] [2023-12-16 19:55:21,679 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:55:21,687 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 19:55:21,695 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.swap_two.c[1248,1261] [2023-12-16 19:55:21,707 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:55:21,718 INFO L206 MainTranslator]: Completed translation [2023-12-16 19:55:21,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:21 WrapperNode [2023-12-16 19:55:21,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 19:55:21,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 19:55:21,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 19:55:21,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 19:55:21,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:21" (1/1) ... [2023-12-16 19:55:21,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:21" (1/1) ... [2023-12-16 19:55:21,760 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 135 [2023-12-16 19:55:21,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 19:55:21,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 19:55:21,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 19:55:21,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 19:55:21,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:21" (1/1) ... [2023-12-16 19:55:21,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:21" (1/1) ... [2023-12-16 19:55:21,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:21" (1/1) ... [2023-12-16 19:55:21,805 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-16 19:55:21,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:21" (1/1) ... [2023-12-16 19:55:21,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:21" (1/1) ... [2023-12-16 19:55:21,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:21" (1/1) ... [2023-12-16 19:55:21,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:21" (1/1) ... [2023-12-16 19:55:21,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:21" (1/1) ... [2023-12-16 19:55:21,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:21" (1/1) ... [2023-12-16 19:55:21,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 19:55:21,820 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 19:55:21,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 19:55:21,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 19:55:21,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:21" (1/1) ... [2023-12-16 19:55:21,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:55:21,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:55:21,874 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-16 19:55:21,886 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-16 19:55:21,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 19:55:21,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 19:55:21,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 19:55:21,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 19:55:22,004 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 19:55:22,006 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 19:55:22,296 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 19:55:22,317 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 19:55:22,317 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 19:55:22,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:55:22 BoogieIcfgContainer [2023-12-16 19:55:22,318 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 19:55:22,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 19:55:22,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 19:55:22,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 19:55:22,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:55:21" (1/3) ... [2023-12-16 19:55:22,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85b4bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:55:22, skipping insertion in model container [2023-12-16 19:55:22,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:21" (2/3) ... [2023-12-16 19:55:22,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85b4bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:55:22, skipping insertion in model container [2023-12-16 19:55:22,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:55:22" (3/3) ... [2023-12-16 19:55:22,324 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.swap_two.c [2023-12-16 19:55:22,336 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 19:55:22,336 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 19:55:22,380 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 19:55:22,388 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;@4176b662, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 19:55:22,388 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 19:55:22,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 28 states have internal predecessors, (45), 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-16 19:55:22,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 19:55:22,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:22,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:55:22,398 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:22,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:22,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1976834003, now seen corresponding path program 1 times [2023-12-16 19:55:22,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:22,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817012743] [2023-12-16 19:55:22,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:22,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:55:22,947 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-16 19:55:22,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:55:22,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817012743] [2023-12-16 19:55:22,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817012743] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:55:22,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:55:22,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:55:22,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822865724] [2023-12-16 19:55:22,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:55:22,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:55:22,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:55:22,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:55:22,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:55:22,995 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 28 states have internal predecessors, (45), 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 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-16 19:55:23,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:55:23,049 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions. [2023-12-16 19:55:23,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:55:23,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2023-12-16 19:55:23,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:55:23,057 INFO L225 Difference]: With dead ends: 51 [2023-12-16 19:55:23,057 INFO L226 Difference]: Without dead ends: 29 [2023-12-16 19:55:23,060 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-16 19:55:23,065 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 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-16 19:55:23,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:55:23,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-16 19:55:23,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-16 19:55:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:23,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2023-12-16 19:55:23,096 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 43 transitions. Word has length 18 [2023-12-16 19:55:23,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:55:23,097 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 43 transitions. [2023-12-16 19:55:23,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-16 19:55:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2023-12-16 19:55:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-16 19:55:23,099 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:23,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:55:23,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 19:55:23,099 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:23,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:23,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1150586917, now seen corresponding path program 1 times [2023-12-16 19:55:23,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:23,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216482134] [2023-12-16 19:55:23,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:23,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:55:23,250 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-16 19:55:23,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:55:23,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216482134] [2023-12-16 19:55:23,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216482134] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:55:23,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:55:23,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:55:23,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909652141] [2023-12-16 19:55:23,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:55:23,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:55:23,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:55:23,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:55:23,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:55:23,259 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-16 19:55:23,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:55:23,295 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2023-12-16 19:55:23,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:55:23,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2023-12-16 19:55:23,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:55:23,298 INFO L225 Difference]: With dead ends: 54 [2023-12-16 19:55:23,298 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 19:55:23,298 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-16 19:55:23,299 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 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-16 19:55:23,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:55:23,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 19:55:23,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-12-16 19:55:23,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 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-16 19:55:23,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2023-12-16 19:55:23,309 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 19 [2023-12-16 19:55:23,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:55:23,309 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2023-12-16 19:55:23,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-16 19:55:23,310 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2023-12-16 19:55:23,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 19:55:23,311 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:23,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:55:23,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 19:55:23,312 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:23,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:23,313 INFO L85 PathProgramCache]: Analyzing trace with hash 256118921, now seen corresponding path program 1 times [2023-12-16 19:55:23,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:23,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031501624] [2023-12-16 19:55:23,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:23,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:55:23,582 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-16 19:55:23,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:55:23,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031501624] [2023-12-16 19:55:23,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031501624] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:55:23,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:55:23,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:55:23,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790316195] [2023-12-16 19:55:23,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:55:23,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:55:23,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:55:23,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:55:23,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:55:23,590 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-16 19:55:23,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:55:23,703 INFO L93 Difference]: Finished difference Result 79 states and 113 transitions. [2023-12-16 19:55:23,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:55:23,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-16 19:55:23,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:55:23,705 INFO L225 Difference]: With dead ends: 79 [2023-12-16 19:55:23,705 INFO L226 Difference]: Without dead ends: 55 [2023-12-16 19:55:23,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:55:23,711 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 97 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:55:23,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 59 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:55:23,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-16 19:55:23,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2023-12-16 19:55:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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-16 19:55:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2023-12-16 19:55:23,724 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 20 [2023-12-16 19:55:23,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:55:23,724 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2023-12-16 19:55:23,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-16 19:55:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2023-12-16 19:55:23,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 19:55:23,725 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:23,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:55:23,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 19:55:23,726 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:23,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:23,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1077270607, now seen corresponding path program 1 times [2023-12-16 19:55:23,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:23,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134816908] [2023-12-16 19:55:23,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:23,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:55:23,874 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-16 19:55:23,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:55:23,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134816908] [2023-12-16 19:55:23,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134816908] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:55:23,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:55:23,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:55:23,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415421551] [2023-12-16 19:55:23,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:55:23,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:55:23,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:55:23,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:55:23,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:55:23,878 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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-16 19:55:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:55:23,967 INFO L93 Difference]: Finished difference Result 79 states and 112 transitions. [2023-12-16 19:55:23,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:55:23,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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 21 [2023-12-16 19:55:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:55:23,970 INFO L225 Difference]: With dead ends: 79 [2023-12-16 19:55:23,970 INFO L226 Difference]: Without dead ends: 55 [2023-12-16 19:55:23,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:55:23,976 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 116 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:55:23,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 85 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:55:23,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-16 19:55:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36. [2023-12-16 19:55:23,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 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-16 19:55:23,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2023-12-16 19:55:23,988 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 21 [2023-12-16 19:55:23,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:55:23,988 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2023-12-16 19:55:23,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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-16 19:55:23,989 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2023-12-16 19:55:23,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 19:55:23,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:23,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:55:23,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 19:55:23,990 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:23,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:23,991 INFO L85 PathProgramCache]: Analyzing trace with hash -800803165, now seen corresponding path program 1 times [2023-12-16 19:55:23,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:23,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053774834] [2023-12-16 19:55:23,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:23,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:55:24,206 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-16 19:55:24,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:55:24,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053774834] [2023-12-16 19:55:24,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053774834] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:55:24,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:55:24,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:55:24,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532821318] [2023-12-16 19:55:24,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:55:24,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:55:24,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:55:24,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:55:24,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:55:24,209 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:24,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:55:24,347 INFO L93 Difference]: Finished difference Result 81 states and 113 transitions. [2023-12-16 19:55:24,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:55:24,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-16 19:55:24,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:55:24,350 INFO L225 Difference]: With dead ends: 81 [2023-12-16 19:55:24,350 INFO L226 Difference]: Without dead ends: 55 [2023-12-16 19:55:24,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:55:24,351 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 94 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:55:24,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 59 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:55:24,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-16 19:55:24,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36. [2023-12-16 19:55:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 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-16 19:55:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2023-12-16 19:55:24,366 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 22 [2023-12-16 19:55:24,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:55:24,366 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2023-12-16 19:55:24,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2023-12-16 19:55:24,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 19:55:24,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:24,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:55:24,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 19:55:24,367 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:24,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:24,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2080666843, now seen corresponding path program 1 times [2023-12-16 19:55:24,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:24,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199654145] [2023-12-16 19:55:24,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:24,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:55:24,509 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-16 19:55:24,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:55:24,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199654145] [2023-12-16 19:55:24,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199654145] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:55:24,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:55:24,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:55:24,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243661832] [2023-12-16 19:55:24,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:55:24,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:55:24,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:55:24,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:55:24,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:55:24,511 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:24,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:55:24,598 INFO L93 Difference]: Finished difference Result 79 states and 110 transitions. [2023-12-16 19:55:24,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:55:24,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-16 19:55:24,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:55:24,599 INFO L225 Difference]: With dead ends: 79 [2023-12-16 19:55:24,599 INFO L226 Difference]: Without dead ends: 55 [2023-12-16 19:55:24,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:55:24,600 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 86 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:55:24,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 58 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:55:24,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-16 19:55:24,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2023-12-16 19:55:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 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-16 19:55:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2023-12-16 19:55:24,611 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 22 [2023-12-16 19:55:24,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:55:24,614 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2023-12-16 19:55:24,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:55:24,618 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2023-12-16 19:55:24,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 19:55:24,618 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:24,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:55:24,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 19:55:24,619 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:24,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:24,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1822501405, now seen corresponding path program 1 times [2023-12-16 19:55:24,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:24,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722717922] [2023-12-16 19:55:24,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:24,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:55:24,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 19:55:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:55:24,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 19:55:24,734 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 19:55:24,735 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 19:55:24,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 19:55:24,739 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:55:24,741 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 19:55:24,778 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:55:24,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:55:24 BoogieIcfgContainer [2023-12-16 19:55:24,786 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 19:55:24,787 INFO L158 Benchmark]: Toolchain (without parser) took 3317.14ms. Allocated memory is still 280.0MB. Free memory was 226.3MB in the beginning and 163.2MB in the end (delta: 63.1MB). Peak memory consumption was 63.6MB. Max. memory is 8.0GB. [2023-12-16 19:55:24,787 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 205.5MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:55:24,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.70ms. Allocated memory is still 280.0MB. Free memory was 226.1MB in the beginning and 214.3MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 19:55:24,787 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.13ms. Allocated memory is still 280.0MB. Free memory was 214.3MB in the beginning and 211.6MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 19:55:24,788 INFO L158 Benchmark]: Boogie Preprocessor took 57.99ms. Allocated memory is still 280.0MB. Free memory was 211.6MB in the beginning and 209.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 19:55:24,790 INFO L158 Benchmark]: RCFGBuilder took 498.06ms. Allocated memory is still 280.0MB. Free memory was 209.3MB in the beginning and 243.1MB in the end (delta: -33.8MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-16 19:55:24,791 INFO L158 Benchmark]: TraceAbstraction took 2466.75ms. Allocated memory is still 280.0MB. Free memory was 242.5MB in the beginning and 163.2MB in the end (delta: 79.3MB). Peak memory consumption was 79.3MB. Max. memory is 8.0GB. [2023-12-16 19:55:24,792 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.09ms. Allocated memory is still 205.5MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.70ms. Allocated memory is still 280.0MB. Free memory was 226.1MB in the beginning and 214.3MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.13ms. Allocated memory is still 280.0MB. Free memory was 214.3MB in the beginning and 211.6MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.99ms. Allocated memory is still 280.0MB. Free memory was 211.6MB in the beginning and 209.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 498.06ms. Allocated memory is still 280.0MB. Free memory was 209.3MB in the beginning and 243.1MB in the end (delta: -33.8MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 2466.75ms. Allocated memory is still 280.0MB. Free memory was 242.5MB in the beginning and 163.2MB in the end (delta: 79.3MB). Peak memory consumption was 79.3MB. 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 76. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 20); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (20 - 1); [L32] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 32); [L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (32 - 1); [L35] const SORT_4 var_5 = 100; [L36] const SORT_8 var_10 = 100; [L37] const SORT_8 var_13 = 200; [L38] const SORT_1 var_18 = 1; [L39] const SORT_4 var_22 = 200; [L41] SORT_1 input_2; [L42] SORT_1 input_3; [L44] EXPR __VERIFIER_nondet_uint() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, var_10=100, var_13=200, var_18=1, var_22=200, var_5=100] [L44] SORT_4 state_6 = __VERIFIER_nondet_uint() & mask_SORT_4; [L45] EXPR __VERIFIER_nondet_uint() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_6=0, var_10=100, var_13=200, var_18=1, var_22=200, var_5=100] [L45] SORT_4 state_23 = __VERIFIER_nondet_uint() & mask_SORT_4; [L47] SORT_4 init_7_arg_1 = var_5; [L48] state_6 = init_7_arg_1 [L49] SORT_4 init_24_arg_1 = var_22; [L50] state_23 = init_24_arg_1 VAL [init_24_arg_1=200, init_7_arg_1=100, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_23=200, state_6=100, var_10=100, var_13=200, var_18=1, var_22=200, var_5=100] [L53] input_2 = __VERIFIER_nondet_uchar() [L54] input_3 = __VERIFIER_nondet_uchar() [L57] SORT_4 var_9_arg_0 = state_6; VAL [init_24_arg_1=200, init_7_arg_1=100, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_23=200, state_6=100, var_10=100, var_13=200, var_18=1, var_22=200, var_5=100, var_9_arg_0=100] [L58] EXPR var_9_arg_0 & mask_SORT_4 VAL [init_24_arg_1=200, init_7_arg_1=100, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_23=200, state_6=100, var_10=100, var_13=200, var_18=1, var_22=200, var_5=100, var_9_arg_0=100] [L58] var_9_arg_0 = var_9_arg_0 & mask_SORT_4 [L59] SORT_8 var_9 = var_9_arg_0; [L60] SORT_8 var_11_arg_0 = var_9; [L61] SORT_8 var_11_arg_1 = var_10; [L62] SORT_1 var_11 = var_11_arg_0 == var_11_arg_1; [L63] SORT_4 var_12_arg_0 = state_6; VAL [init_24_arg_1=200, init_7_arg_1=100, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_23=200, state_6=100, var_10=100, var_11=0, var_11_arg_0=0, var_11_arg_1=100, var_12_arg_0=100, var_13=200, var_18=1, var_22=200, var_5=100, var_9=0, var_9_arg_0=0] [L64] EXPR var_12_arg_0 & mask_SORT_4 VAL [init_24_arg_1=200, init_7_arg_1=100, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_23=200, state_6=100, var_10=100, var_11=0, var_11_arg_0=0, var_11_arg_1=100, var_12_arg_0=100, var_13=200, var_18=1, var_22=200, var_5=100, var_9=0, var_9_arg_0=0] [L64] var_12_arg_0 = var_12_arg_0 & mask_SORT_4 [L65] SORT_8 var_12 = var_12_arg_0; [L66] SORT_8 var_14_arg_0 = var_12; [L67] SORT_8 var_14_arg_1 = var_13; [L68] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L69] SORT_1 var_15_arg_0 = var_11; [L70] SORT_1 var_15_arg_1 = var_14; VAL [init_24_arg_1=200, init_7_arg_1=100, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_23=200, state_6=100, var_10=100, var_11=0, var_11_arg_0=0, var_11_arg_1=100, var_12=0, var_12_arg_0=0, var_13=200, var_14=0, var_14_arg_0=0, var_14_arg_1=200, var_15_arg_0=0, var_15_arg_1=0, var_18=1, var_22=200, var_5=100, var_9=0, var_9_arg_0=0] [L71] EXPR var_15_arg_0 | var_15_arg_1 VAL [init_24_arg_1=200, init_7_arg_1=100, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_23=200, state_6=100, var_10=100, var_11=0, var_11_arg_0=0, var_11_arg_1=100, var_12=0, var_12_arg_0=0, var_13=200, var_14=0, var_14_arg_0=0, var_14_arg_1=200, var_15_arg_0=0, var_15_arg_1=0, var_18=1, var_22=200, var_5=100, var_9=0, var_9_arg_0=0] [L71] SORT_1 var_15 = var_15_arg_0 | var_15_arg_1; [L72] SORT_1 var_19_arg_0 = var_15; [L73] SORT_1 var_19 = ~var_19_arg_0; [L74] SORT_1 var_20_arg_0 = var_18; [L75] SORT_1 var_20_arg_1 = var_19; VAL [init_24_arg_1=200, init_7_arg_1=100, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_23=200, state_6=100, var_10=100, var_11=0, var_11_arg_0=0, var_11_arg_1=100, var_12=0, var_12_arg_0=0, var_13=200, var_14=0, var_14_arg_0=0, var_14_arg_1=200, var_15=0, var_15_arg_0=0, var_15_arg_1=0, var_18=1, var_19=255, var_19_arg_0=0, var_20_arg_0=1, var_20_arg_1=255, var_22=200, var_5=100, var_9=0, var_9_arg_0=0] [L76] EXPR var_20_arg_0 & var_20_arg_1 VAL [init_24_arg_1=200, init_7_arg_1=100, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_23=200, state_6=100, var_10=100, var_11=0, var_11_arg_0=0, var_11_arg_1=100, var_12=0, var_12_arg_0=0, var_13=200, var_14=0, var_14_arg_0=0, var_14_arg_1=200, var_15=0, var_15_arg_0=0, var_15_arg_1=0, var_18=1, var_19=255, var_19_arg_0=0, var_20_arg_0=1, var_20_arg_1=255, var_22=200, var_5=100, var_9=0, var_9_arg_0=0] [L76] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L77] EXPR var_20 & mask_SORT_1 VAL [init_24_arg_1=200, init_7_arg_1=100, mask_SORT_1=1, mask_SORT_4=1048575, mask_SORT_8=4294967295, msb_SORT_1=1, msb_SORT_4=524288, msb_SORT_8=2147483648, state_23=200, state_6=100, var_10=100, var_11=0, var_11_arg_0=0, var_11_arg_1=100, var_12=0, var_12_arg_0=0, var_13=200, var_14=0, var_14_arg_0=0, var_14_arg_1=200, var_15=0, var_15_arg_0=0, var_15_arg_1=0, var_18=1, var_19=255, var_19_arg_0=0, var_20=1, var_20_arg_0=1, var_20_arg_1=255, var_22=200, var_5=100, var_9=0, var_9_arg_0=0] [L77] var_20 = var_20 & mask_SORT_1 [L78] SORT_1 bad_21_arg_0 = var_20; [L79] CALL __VERIFIER_assert(!(bad_21_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, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 395 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 395 mSDsluCounter, 477 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 310 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 256 IncrementalHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 167 mSDtfsCounter, 256 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=6, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 79 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-16 19:55:24,816 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...