./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 82abe2bc16b32af306db7c09a41c9db0587ba64425916c43bed05447e1d05407 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:31:07,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:31:07,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:31:07,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:31:07,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:31:07,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:31:07,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:31:07,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:31:07,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:31:07,294 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:31:07,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:31:07,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:31:07,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:31:07,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:31:07,295 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:31:07,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:31:07,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:31:07,296 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:31:07,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:31:07,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:31:07,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:31:07,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:31:07,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:31:07,296 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:31:07,296 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:31:07,296 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:31:07,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:31:07,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:31:07,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:31:07,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:31:07,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:31:07,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:31:07,297 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:31:07,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:31:07,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:31:07,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:31:07,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:31:07,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:31:07,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:31:07,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:31:07,298 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 82abe2bc16b32af306db7c09a41c9db0587ba64425916c43bed05447e1d05407 [2025-03-03 17:31:07,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:31:07,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:31:07,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:31:07,565 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:31:07,566 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:31:07,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c [2025-03-03 17:31:08,770 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86af718ec/b101bba9e12f4d35bdddb13d41c32a3d/FLAGf398c3db7 [2025-03-03 17:31:09,085 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:31:09,090 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c [2025-03-03 17:31:09,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86af718ec/b101bba9e12f4d35bdddb13d41c32a3d/FLAGf398c3db7 [2025-03-03 17:31:09,322 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86af718ec/b101bba9e12f4d35bdddb13d41c32a3d [2025-03-03 17:31:09,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:31:09,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:31:09,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:31:09,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:31:09,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:31:09,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:31:09" (1/1) ... [2025-03-03 17:31:09,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f28a534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:09, skipping insertion in model container [2025-03-03 17:31:09,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:31:09" (1/1) ... [2025-03-03 17:31:09,365 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:31:09,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c[1174,1187] [2025-03-03 17:31:09,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:31:09,765 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:31:09,772 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c[1174,1187] [2025-03-03 17:31:09,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:31:09,885 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:31:09,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:09 WrapperNode [2025-03-03 17:31:09,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:31:09,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:31:09,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:31:09,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:31:09,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:09" (1/1) ... [2025-03-03 17:31:09,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:09" (1/1) ... [2025-03-03 17:31:10,277 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3784 [2025-03-03 17:31:10,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:31:10,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:31:10,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:31:10,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:31:10,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:09" (1/1) ... [2025-03-03 17:31:10,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:09" (1/1) ... [2025-03-03 17:31:10,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:09" (1/1) ... [2025-03-03 17:31:10,499 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]. [2025-03-03 17:31:10,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:09" (1/1) ... [2025-03-03 17:31:10,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:09" (1/1) ... [2025-03-03 17:31:10,586 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:09" (1/1) ... [2025-03-03 17:31:10,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:09" (1/1) ... [2025-03-03 17:31:10,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:09" (1/1) ... [2025-03-03 17:31:10,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:09" (1/1) ... [2025-03-03 17:31:10,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:31:10,716 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:31:10,717 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:31:10,717 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:31:10,717 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:09" (1/1) ... [2025-03-03 17:31:10,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:31:10,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:31:10,744 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) [2025-03-03 17:31:10,746 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 [2025-03-03 17:31:10,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:31:10,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:31:10,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:31:10,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:31:10,976 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:31:10,978 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:31:14,109 INFO L? ?]: Removed 2119 outVars from TransFormulas that were not future-live. [2025-03-03 17:31:14,109 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:31:14,244 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:31:14,244 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:31:14,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:31:14 BoogieIcfgContainer [2025-03-03 17:31:14,244 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:31:14,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:31:14,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:31:14,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:31:14,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:31:09" (1/3) ... [2025-03-03 17:31:14,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aad9036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:31:14, skipping insertion in model container [2025-03-03 17:31:14,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:09" (2/3) ... [2025-03-03 17:31:14,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aad9036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:31:14, skipping insertion in model container [2025-03-03 17:31:14,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:31:14" (3/3) ... [2025-03-03 17:31:14,251 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.fischer.1.prop1-func-interl.c [2025-03-03 17:31:14,263 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:31:14,265 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.fischer.1.prop1-func-interl.c that has 1 procedures, 1328 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:31:14,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:31:14,389 INFO L333 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, 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;@4069c50b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:31:14,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:31:14,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 1328 states, 1326 states have (on average 1.5015082956259427) internal successors, (1991), 1327 states have internal predecessors, (1991), 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) [2025-03-03 17:31:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 17:31:14,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:31:14,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:31:14,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:31:14,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:31:14,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1250589363, now seen corresponding path program 1 times [2025-03-03 17:31:14,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:31:14,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345551525] [2025-03-03 17:31:14,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:31:14,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:31:14,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 17:31:14,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 17:31:14,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:31:14,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:31:15,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:31:15,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:31:15,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345551525] [2025-03-03 17:31:15,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345551525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:31:15,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:31:15,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:31:15,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387257757] [2025-03-03 17:31:15,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:31:15,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:31:15,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:31:15,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:31:15,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:31:15,316 INFO L87 Difference]: Start difference. First operand has 1328 states, 1326 states have (on average 1.5015082956259427) internal successors, (1991), 1327 states have internal predecessors, (1991), 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 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:31:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:31:17,246 INFO L93 Difference]: Finished difference Result 3818 states and 5731 transitions. [2025-03-03 17:31:17,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:31:17,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 17:31:17,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:31:17,269 INFO L225 Difference]: With dead ends: 3818 [2025-03-03 17:31:17,270 INFO L226 Difference]: Without dead ends: 2564 [2025-03-03 17:31:17,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:31:17,281 INFO L435 NwaCegarLoop]: 1266 mSDtfsCounter, 1902 mSDsluCounter, 3725 mSDsCounter, 0 mSdLazyCounter, 2848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1902 SdHoareTripleChecker+Valid, 4991 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 17:31:17,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1902 Valid, 4991 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2848 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 17:31:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2025-03-03 17:31:17,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 1384. [2025-03-03 17:31:17,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.499638467100506) internal successors, (2074), 1383 states have internal predecessors, (2074), 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) [2025-03-03 17:31:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2074 transitions. [2025-03-03 17:31:17,354 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2074 transitions. Word has length 77 [2025-03-03 17:31:17,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:31:17,354 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2074 transitions. [2025-03-03 17:31:17,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:31:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2074 transitions. [2025-03-03 17:31:17,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 17:31:17,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:31:17,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:31:17,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:31:17,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:31:17,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:31:17,358 INFO L85 PathProgramCache]: Analyzing trace with hash 754942132, now seen corresponding path program 1 times [2025-03-03 17:31:17,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:31:17,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418655114] [2025-03-03 17:31:17,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:31:17,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:31:17,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 17:31:17,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 17:31:17,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:31:17,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:31:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:31:17,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:31:17,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418655114] [2025-03-03 17:31:17,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418655114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:31:17,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:31:17,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:31:17,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264358389] [2025-03-03 17:31:17,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:31:17,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:31:17,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:31:17,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:31:17,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:31:17,639 INFO L87 Difference]: Start difference. First operand 1384 states and 2074 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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) [2025-03-03 17:31:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:31:18,171 INFO L93 Difference]: Finished difference Result 1388 states and 2078 transitions. [2025-03-03 17:31:18,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:31:18,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2025-03-03 17:31:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:31:18,177 INFO L225 Difference]: With dead ends: 1388 [2025-03-03 17:31:18,177 INFO L226 Difference]: Without dead ends: 1386 [2025-03-03 17:31:18,182 INFO L434 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 [2025-03-03 17:31:18,182 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 0 mSDsluCounter, 3309 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4966 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:31:18,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4966 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:31:18,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2025-03-03 17:31:18,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1386. [2025-03-03 17:31:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1385 states have (on average 1.4989169675090253) internal successors, (2076), 1385 states have internal predecessors, (2076), 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) [2025-03-03 17:31:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2076 transitions. [2025-03-03 17:31:18,210 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2076 transitions. Word has length 79 [2025-03-03 17:31:18,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:31:18,211 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 2076 transitions. [2025-03-03 17:31:18,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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) [2025-03-03 17:31:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2076 transitions. [2025-03-03 17:31:18,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 17:31:18,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:31:18,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:31:18,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:31:18,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:31:18,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:31:18,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1933050813, now seen corresponding path program 1 times [2025-03-03 17:31:18,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:31:18,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063962735] [2025-03-03 17:31:18,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:31:18,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:31:18,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 17:31:18,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 17:31:18,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:31:18,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:31:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:31:18,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:31:18,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063962735] [2025-03-03 17:31:18,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063962735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:31:18,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:31:18,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:31:18,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035412191] [2025-03-03 17:31:18,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:31:18,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:31:18,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:31:18,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:31:18,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:31:18,433 INFO L87 Difference]: Start difference. First operand 1386 states and 2076 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2025-03-03 17:31:18,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:31:18,986 INFO L93 Difference]: Finished difference Result 2641 states and 3958 transitions. [2025-03-03 17:31:18,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:31:18,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 80 [2025-03-03 17:31:18,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:31:18,992 INFO L225 Difference]: With dead ends: 2641 [2025-03-03 17:31:18,992 INFO L226 Difference]: Without dead ends: 1388 [2025-03-03 17:31:18,994 INFO L434 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 [2025-03-03 17:31:18,997 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 0 mSDsluCounter, 3306 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4963 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:31:18,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4963 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:31:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2025-03-03 17:31:19,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1388. [2025-03-03 17:31:19,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1387 states have (on average 1.498197548666186) internal successors, (2078), 1387 states have internal predecessors, (2078), 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) [2025-03-03 17:31:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2078 transitions. [2025-03-03 17:31:19,023 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2078 transitions. Word has length 80 [2025-03-03 17:31:19,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:31:19,024 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 2078 transitions. [2025-03-03 17:31:19,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2025-03-03 17:31:19,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2078 transitions. [2025-03-03 17:31:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 17:31:19,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:31:19,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:31:19,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:31:19,028 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:31:19,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:31:19,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1726544335, now seen corresponding path program 1 times [2025-03-03 17:31:19,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:31:19,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299985217] [2025-03-03 17:31:19,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:31:19,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:31:19,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 17:31:19,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 17:31:19,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:31:19,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:31:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:31:19,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:31:19,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299985217] [2025-03-03 17:31:19,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299985217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:31:19,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:31:19,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:31:19,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348044929] [2025-03-03 17:31:19,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:31:19,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:31:19,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:31:19,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:31:19,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:31:19,335 INFO L87 Difference]: Start difference. First operand 1388 states and 2078 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:31:20,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:31:20,613 INFO L93 Difference]: Finished difference Result 2655 states and 3975 transitions. [2025-03-03 17:31:20,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:31:20,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 17:31:20,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:31:20,619 INFO L225 Difference]: With dead ends: 2655 [2025-03-03 17:31:20,619 INFO L226 Difference]: Without dead ends: 1400 [2025-03-03 17:31:20,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:31:20,623 INFO L435 NwaCegarLoop]: 1648 mSDtfsCounter, 1937 mSDsluCounter, 4540 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1937 SdHoareTripleChecker+Valid, 6188 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:31:20,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1937 Valid, 6188 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 17:31:20,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2025-03-03 17:31:20,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1397. [2025-03-03 17:31:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1396 states have (on average 1.4964183381088825) internal successors, (2089), 1396 states have internal predecessors, (2089), 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) [2025-03-03 17:31:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2089 transitions. [2025-03-03 17:31:20,648 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2089 transitions. Word has length 81 [2025-03-03 17:31:20,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:31:20,649 INFO L471 AbstractCegarLoop]: Abstraction has 1397 states and 2089 transitions. [2025-03-03 17:31:20,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:31:20,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2089 transitions. [2025-03-03 17:31:20,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 17:31:20,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:31:20,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:31:20,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:31:20,650 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:31:20,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:31:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash 594328666, now seen corresponding path program 1 times [2025-03-03 17:31:20,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:31:20,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781253173] [2025-03-03 17:31:20,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:31:20,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:31:20,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 17:31:20,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 17:31:20,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:31:20,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:31:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:31:21,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:31:21,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781253173] [2025-03-03 17:31:21,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781253173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:31:21,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:31:21,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:31:21,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397412307] [2025-03-03 17:31:21,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:31:21,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:31:21,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:31:21,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:31:21,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:31:21,391 INFO L87 Difference]: Start difference. First operand 1397 states and 2089 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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) [2025-03-03 17:31:22,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:31:22,481 INFO L93 Difference]: Finished difference Result 3586 states and 5367 transitions. [2025-03-03 17:31:22,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:31:22,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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 82 [2025-03-03 17:31:22,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:31:22,489 INFO L225 Difference]: With dead ends: 3586 [2025-03-03 17:31:22,489 INFO L226 Difference]: Without dead ends: 2320 [2025-03-03 17:31:22,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:31:22,491 INFO L435 NwaCegarLoop]: 1645 mSDtfsCounter, 1513 mSDsluCounter, 6475 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 8120 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:31:22,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 8120 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1706 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 17:31:22,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2025-03-03 17:31:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 1392. [2025-03-03 17:31:22,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1391 states have (on average 1.496764917325665) internal successors, (2082), 1391 states have internal predecessors, (2082), 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) [2025-03-03 17:31:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2082 transitions. [2025-03-03 17:31:22,517 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2082 transitions. Word has length 82 [2025-03-03 17:31:22,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:31:22,517 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 2082 transitions. [2025-03-03 17:31:22,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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) [2025-03-03 17:31:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2082 transitions. [2025-03-03 17:31:22,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 17:31:22,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:31:22,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:31:22,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:31:22,519 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:31:22,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:31:22,519 INFO L85 PathProgramCache]: Analyzing trace with hash -423335902, now seen corresponding path program 1 times [2025-03-03 17:31:22,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:31:22,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546393598] [2025-03-03 17:31:22,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:31:22,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:31:22,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 17:31:22,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 17:31:22,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:31:22,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:31:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:31:22,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:31:22,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546393598] [2025-03-03 17:31:22,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546393598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:31:22,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:31:22,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:31:22,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968215100] [2025-03-03 17:31:22,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:31:22,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:31:22,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:31:22,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:31:22,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:31:22,687 INFO L87 Difference]: Start difference. First operand 1392 states and 2082 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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) [2025-03-03 17:31:24,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:31:24,120 INFO L93 Difference]: Finished difference Result 2653 states and 3971 transitions. [2025-03-03 17:31:24,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:31:24,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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 82 [2025-03-03 17:31:24,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:31:24,125 INFO L225 Difference]: With dead ends: 2653 [2025-03-03 17:31:24,126 INFO L226 Difference]: Without dead ends: 1392 [2025-03-03 17:31:24,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:31:24,128 INFO L435 NwaCegarLoop]: 1258 mSDtfsCounter, 1914 mSDsluCounter, 2506 mSDsCounter, 0 mSdLazyCounter, 2182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1914 SdHoareTripleChecker+Valid, 3764 SdHoareTripleChecker+Invalid, 2183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:31:24,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1914 Valid, 3764 Invalid, 2183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2182 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 17:31:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-03 17:31:24,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1386. [2025-03-03 17:31:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1385 states have (on average 1.496028880866426) internal successors, (2072), 1385 states have internal predecessors, (2072), 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) [2025-03-03 17:31:24,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2072 transitions. [2025-03-03 17:31:24,152 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2072 transitions. Word has length 82 [2025-03-03 17:31:24,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:31:24,152 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 2072 transitions. [2025-03-03 17:31:24,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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) [2025-03-03 17:31:24,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2072 transitions. [2025-03-03 17:31:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 17:31:24,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:31:24,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:31:24,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:31:24,155 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:31:24,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:31:24,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1582942421, now seen corresponding path program 1 times [2025-03-03 17:31:24,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:31:24,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643176878] [2025-03-03 17:31:24,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:31:24,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:31:24,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 17:31:24,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 17:31:24,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:31:24,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:31:24,203 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:31:24,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 17:31:24,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 17:31:24,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:31:24,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:31:24,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:31:24,285 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:31:24,286 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:31:24,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:31:24,291 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:31:24,352 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:31:24,368 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:31:24,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:31:24 BoogieIcfgContainer [2025-03-03 17:31:24,370 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:31:24,371 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:31:24,371 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:31:24,371 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:31:24,372 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:31:14" (3/4) ... [2025-03-03 17:31:24,373 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:31:24,374 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:31:24,374 INFO L158 Benchmark]: Toolchain (without parser) took 15048.77ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 112.6MB in the beginning and 186.4MB in the end (delta: -73.7MB). Peak memory consumption was 177.6MB. Max. memory is 16.1GB. [2025-03-03 17:31:24,374 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:31:24,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.60ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 61.6MB in the end (delta: 50.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-03 17:31:24,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 391.88ms. Allocated memory is still 142.6MB. Free memory was 61.6MB in the beginning and 53.2MB in the end (delta: 8.4MB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB. [2025-03-03 17:31:24,375 INFO L158 Benchmark]: Boogie Preprocessor took 435.81ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 53.2MB in the beginning and 228.9MB in the end (delta: -175.7MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2025-03-03 17:31:24,375 INFO L158 Benchmark]: IcfgBuilder took 3527.84ms. Allocated memory is still 335.5MB. Free memory was 228.9MB in the beginning and 61.0MB in the end (delta: 168.0MB). Peak memory consumption was 168.4MB. Max. memory is 16.1GB. [2025-03-03 17:31:24,375 INFO L158 Benchmark]: TraceAbstraction took 10124.45ms. Allocated memory was 335.5MB in the beginning and 394.3MB in the end (delta: 58.7MB). Free memory was 61.0MB in the beginning and 186.4MB in the end (delta: -125.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:31:24,375 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 394.3MB. Free memory was 186.4MB in the beginning and 186.4MB in the end (delta: 21.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:31:24,376 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.22ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 559.60ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 61.6MB in the end (delta: 50.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 391.88ms. Allocated memory is still 142.6MB. Free memory was 61.6MB in the beginning and 53.2MB in the end (delta: 8.4MB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 435.81ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 53.2MB in the beginning and 228.9MB in the end (delta: -175.7MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * IcfgBuilder took 3527.84ms. Allocated memory is still 335.5MB. Free memory was 228.9MB in the beginning and 61.0MB in the end (delta: 168.0MB). Peak memory consumption was 168.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10124.45ms. Allocated memory was 335.5MB in the beginning and 394.3MB in the end (delta: 58.7MB). Free memory was 61.0MB in the beginning and 186.4MB in the end (delta: -125.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 394.3MB. Free memory was 186.4MB in the beginning and 186.4MB in the end (delta: 21.5kB). There was no memory consumed. Max. memory is 16.1GB. * 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 184, overapproximation of bitwiseAnd at line 186. 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_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_14 = 0; [L40] const SORT_4 var_43 = 1; [L41] const SORT_4 var_44 = 0; [L42] const SORT_2 var_54 = 0; [L43] const SORT_2 var_56 = 3; [L44] const SORT_2 var_59 = 2; [L45] const SORT_2 var_62 = 1; [L46] const SORT_2 var_70 = 255; [L47] const SORT_3 var_74 = 0; [L48] const SORT_4 var_78 = 255; [L50] SORT_1 input_53; [L51] SORT_1 input_55; [L52] SORT_1 input_57; [L53] SORT_1 input_58; [L54] SORT_1 input_60; [L55] SORT_1 input_61; [L56] SORT_1 input_71; [L57] SORT_1 input_72; [L58] SORT_1 input_73; [L59] SORT_1 input_90; [L60] SORT_1 input_91; [L61] SORT_1 input_106; [L62] SORT_1 input_107; [L63] SORT_1 input_124; [L64] SORT_1 input_132; [L65] SORT_1 input_140; [L66] SORT_1 input_148; [L67] SORT_1 input_156; [L68] SORT_1 input_164; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L70] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L71] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L72] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L73] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L74] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L75] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L76] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L77] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L78] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L79] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L80] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L81] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L82] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L83] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L84] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L85] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L86] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L87] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] SORT_2 init_7_arg_1 = var_5; [L90] state_6 = init_7_arg_1 [L91] SORT_2 init_9_arg_1 = var_5; [L92] state_8 = init_9_arg_1 [L93] SORT_2 init_11_arg_1 = var_5; [L94] state_10 = init_11_arg_1 [L95] SORT_2 init_13_arg_1 = var_5; [L96] state_12 = init_13_arg_1 [L97] SORT_1 init_16_arg_1 = var_14; [L98] state_15 = init_16_arg_1 [L99] SORT_1 init_18_arg_1 = var_14; [L100] state_17 = init_18_arg_1 [L101] SORT_1 init_20_arg_1 = var_14; [L102] state_19 = init_20_arg_1 [L103] SORT_1 init_22_arg_1 = var_14; [L104] state_21 = init_22_arg_1 [L105] SORT_1 init_24_arg_1 = var_14; [L106] state_23 = init_24_arg_1 [L107] SORT_1 init_26_arg_1 = var_14; [L108] state_25 = init_26_arg_1 [L109] SORT_1 init_28_arg_1 = var_14; [L110] state_27 = init_28_arg_1 [L111] SORT_1 init_30_arg_1 = var_14; [L112] state_29 = init_30_arg_1 [L113] SORT_1 init_32_arg_1 = var_14; [L114] state_31 = init_32_arg_1 [L115] SORT_1 init_34_arg_1 = var_14; [L116] state_33 = init_34_arg_1 [L117] SORT_1 init_36_arg_1 = var_14; [L118] state_35 = init_36_arg_1 [L119] SORT_1 init_38_arg_1 = var_14; [L120] state_37 = init_38_arg_1 [L121] SORT_1 init_40_arg_1 = var_14; [L122] state_39 = init_40_arg_1 [L123] SORT_1 init_42_arg_1 = var_14; [L124] state_41 = init_42_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L127] input_53 = __VERIFIER_nondet_uchar() [L128] EXPR input_53 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L128] input_53 = input_53 & mask_SORT_1 [L129] input_55 = __VERIFIER_nondet_uchar() [L130] EXPR input_55 & mask_SORT_1 VAL [input_53=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L130] input_55 = input_55 & mask_SORT_1 [L131] input_57 = __VERIFIER_nondet_uchar() [L132] EXPR input_57 & mask_SORT_1 VAL [input_53=0, input_55=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L132] input_57 = input_57 & mask_SORT_1 [L133] input_58 = __VERIFIER_nondet_uchar() [L134] EXPR input_58 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L134] input_58 = input_58 & mask_SORT_1 [L135] input_60 = __VERIFIER_nondet_uchar() [L136] EXPR input_60 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L136] input_60 = input_60 & mask_SORT_1 [L137] input_61 = __VERIFIER_nondet_uchar() [L138] EXPR input_61 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L138] input_61 = input_61 & mask_SORT_1 [L139] input_71 = __VERIFIER_nondet_uchar() [L140] EXPR input_71 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L140] input_71 = input_71 & mask_SORT_1 [L141] input_72 = __VERIFIER_nondet_uchar() [L142] EXPR input_72 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L142] input_72 = input_72 & mask_SORT_1 [L143] input_73 = __VERIFIER_nondet_uchar() [L144] EXPR input_73 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L144] input_73 = input_73 & mask_SORT_1 [L145] input_90 = __VERIFIER_nondet_uchar() [L146] EXPR input_90 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L146] input_90 = input_90 & mask_SORT_1 [L147] input_91 = __VERIFIER_nondet_uchar() [L148] EXPR input_91 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L148] input_91 = input_91 & mask_SORT_1 [L149] input_106 = __VERIFIER_nondet_uchar() [L150] EXPR input_106 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L150] input_106 = input_106 & mask_SORT_1 [L151] input_107 = __VERIFIER_nondet_uchar() [L152] EXPR input_107 & mask_SORT_1 VAL [input_106=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L152] input_107 = input_107 & mask_SORT_1 [L153] input_124 = __VERIFIER_nondet_uchar() [L154] input_132 = __VERIFIER_nondet_uchar() [L155] input_140 = __VERIFIER_nondet_uchar() [L156] input_148 = __VERIFIER_nondet_uchar() [L157] input_156 = __VERIFIER_nondet_uchar() [L158] input_164 = __VERIFIER_nondet_uchar() [L161] SORT_1 var_45_arg_0 = state_23; [L162] SORT_4 var_45_arg_1 = var_43; [L163] SORT_4 var_45_arg_2 = var_44; [L164] SORT_4 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L165] SORT_1 var_46_arg_0 = state_31; [L166] SORT_4 var_46_arg_1 = var_43; [L167] SORT_4 var_46_arg_2 = var_44; [L168] SORT_4 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L169] SORT_4 var_47_arg_0 = var_45; [L170] SORT_4 var_47_arg_1 = var_46; [L171] SORT_4 var_47 = var_47_arg_0 + var_47_arg_1; [L172] SORT_1 var_48_arg_0 = state_39; [L173] SORT_4 var_48_arg_1 = var_43; [L174] SORT_4 var_48_arg_2 = var_44; [L175] SORT_4 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L176] SORT_4 var_49_arg_0 = var_47; [L177] SORT_4 var_49_arg_1 = var_48; [L178] SORT_4 var_49 = var_49_arg_0 + var_49_arg_1; VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_49=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L179] EXPR var_49 & mask_SORT_4 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L179] var_49 = var_49 & mask_SORT_4 [L180] SORT_4 var_50_arg_0 = var_49; [L181] SORT_4 var_50_arg_1 = var_43; [L182] SORT_1 var_50 = var_50_arg_0 <= var_50_arg_1; [L183] SORT_1 var_51_arg_0 = ~state_41; VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_50=1, var_51_arg_0=-1, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L184] EXPR var_51_arg_0 & mask_SORT_1 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_50=1, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L184] var_51_arg_0 = var_51_arg_0 & mask_SORT_1 [L185] SORT_1 var_51_arg_1 = ~var_50; VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_51_arg_0=1, var_51_arg_1=-2, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L186] EXPR var_51_arg_1 & mask_SORT_1 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_51_arg_0=1, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L186] var_51_arg_1 = var_51_arg_1 & mask_SORT_1 [L187] EXPR var_51_arg_0 & var_51_arg_1 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L187] SORT_1 var_51 = var_51_arg_0 & var_51_arg_1; [L188] EXPR var_51 & mask_SORT_1 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L188] var_51 = var_51 & mask_SORT_1 [L189] SORT_1 bad_52_arg_0 = var_51; [L190] CALL __VERIFIER_assert(!(bad_52_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1328 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7266 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7266 mSDsluCounter, 32992 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23861 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10490 IncrementalHoareTripleChecker+Invalid, 10493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 9131 mSDtfsCounter, 10490 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1397occurred in iteration=4, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 2117 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 564 NumberOfCodeBlocks, 564 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 1812 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 17:31:24,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 82abe2bc16b32af306db7c09a41c9db0587ba64425916c43bed05447e1d05407 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:31:26,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:31:26,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:31:26,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:31:26,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:31:26,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:31:26,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:31:26,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:31:26,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:31:26,539 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:31:26,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:31:26,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:31:26,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:31:26,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:31:26,540 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:31:26,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:31:26,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:31:26,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:31:26,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:31:26,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:31:26,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:31:26,541 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:31:26,541 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:31:26,542 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:31:26,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:31:26,542 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:31:26,542 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:31:26,542 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:31:26,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:31:26,543 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:31:26,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:31:26,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:31:26,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:31:26,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:31:26,543 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:31:26,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:31:26,543 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:31:26,543 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:31:26,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:31:26,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:31:26,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:31:26,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:31:26,544 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 82abe2bc16b32af306db7c09a41c9db0587ba64425916c43bed05447e1d05407 [2025-03-03 17:31:26,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:31:26,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:31:26,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:31:26,801 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:31:26,801 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:31:26,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c [2025-03-03 17:31:27,945 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdbe67afb/b59d45c3847a430c8234c6f8762045c2/FLAGae5e2a379 [2025-03-03 17:31:28,182 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:31:28,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c [2025-03-03 17:31:28,198 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdbe67afb/b59d45c3847a430c8234c6f8762045c2/FLAGae5e2a379 [2025-03-03 17:31:28,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdbe67afb/b59d45c3847a430c8234c6f8762045c2 [2025-03-03 17:31:28,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:31:28,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:31:28,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:31:28,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:31:28,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:31:28,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:31:28" (1/1) ... [2025-03-03 17:31:28,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b5c461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:28, skipping insertion in model container [2025-03-03 17:31:28,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:31:28" (1/1) ... [2025-03-03 17:31:28,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:31:28,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c[1174,1187] [2025-03-03 17:31:28,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:31:28,636 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:31:28,647 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c[1174,1187] [2025-03-03 17:31:28,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:31:28,748 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:31:28,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:28 WrapperNode [2025-03-03 17:31:28,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:31:28,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:31:28,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:31:28,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:31:28,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:28" (1/1) ... [2025-03-03 17:31:28,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:28" (1/1) ... [2025-03-03 17:31:28,831 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1148 [2025-03-03 17:31:28,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:31:28,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:31:28,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:31:28,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:31:28,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:28" (1/1) ... [2025-03-03 17:31:28,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:28" (1/1) ... [2025-03-03 17:31:28,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:28" (1/1) ... [2025-03-03 17:31:28,880 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]. [2025-03-03 17:31:28,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:28" (1/1) ... [2025-03-03 17:31:28,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:28" (1/1) ... [2025-03-03 17:31:28,934 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:28" (1/1) ... [2025-03-03 17:31:28,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:28" (1/1) ... [2025-03-03 17:31:28,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:28" (1/1) ... [2025-03-03 17:31:28,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:28" (1/1) ... [2025-03-03 17:31:28,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:31:28,962 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:31:28,963 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:31:28,963 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:31:28,964 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:28" (1/1) ... [2025-03-03 17:31:28,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:31:28,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:31:28,993 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) [2025-03-03 17:31:28,996 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 [2025-03-03 17:31:29,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:31:29,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:31:29,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:31:29,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:31:29,221 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:31:29,223 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:31:29,983 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2025-03-03 17:31:29,983 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:31:29,988 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:31:29,988 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:31:29,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:31:29 BoogieIcfgContainer [2025-03-03 17:31:29,989 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:31:29,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:31:29,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:31:29,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:31:29,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:31:28" (1/3) ... [2025-03-03 17:31:29,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491f8c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:31:29, skipping insertion in model container [2025-03-03 17:31:29,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:28" (2/3) ... [2025-03-03 17:31:29,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491f8c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:31:29, skipping insertion in model container [2025-03-03 17:31:29,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:31:29" (3/3) ... [2025-03-03 17:31:29,999 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.fischer.1.prop1-func-interl.c [2025-03-03 17:31:30,010 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:31:30,012 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.fischer.1.prop1-func-interl.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:31:30,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:31:30,057 INFO L333 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, 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;@70897408, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:31:30,058 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:31:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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) [2025-03-03 17:31:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:31:30,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:31:30,066 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:31:30,067 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:31:30,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:31:30,071 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:31:30,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:31:30,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1751878671] [2025-03-03 17:31:30,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:31:30,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:31:30,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:31:30,082 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:31:30,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 17:31:30,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:31:30,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:31:30,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:31:30,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:31:30,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-03 17:31:30,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:31:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:31:30,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:31:30,564 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:31:30,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751878671] [2025-03-03 17:31:30,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751878671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:31:30,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:31:30,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:31:30,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689345009] [2025-03-03 17:31:30,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:31:30,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:31:30,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:31:30,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:31:30,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:31:30,587 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2025-03-03 17:31:30,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:31:30,683 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 17:31:30,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:31:30,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2025-03-03 17:31:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:31:30,692 INFO L225 Difference]: With dead ends: 18 [2025-03-03 17:31:30,692 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 17:31:30,694 INFO L434 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 [2025-03-03 17:31:30,696 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:31:30,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:31:30,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 17:31:30,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 17:31:30,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) [2025-03-03 17:31:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:31:30,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:31:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:31:30,717 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:31:30,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2025-03-03 17:31:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:31:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:31:30,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:31:30,718 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:31:30,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 17:31:30,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:31:30,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:31:30,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:31:30,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:31:30,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:31:30,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1194005120] [2025-03-03 17:31:30,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:31:30,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:31:30,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:31:30,922 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:31:30,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 17:31:31,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:31:31,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:31:31,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:31:31,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:31:31,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-03 17:31:31,239 INFO L279 TraceCheckSpWp]: Computing forward predicates...