./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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.vis_arrays_vsa16a_p5.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 b88007960cae79b63604455924d89f4d8e6ff83730f3fe3600fe1cad3b333850 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:49:41,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:49:41,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:49:41,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:49:41,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:49:41,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:49:41,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:49:41,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:49:41,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:49:41,926 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:49:41,926 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:49:41,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:49:41,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:49:41,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:49:41,927 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:49:41,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:49:41,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:49:41,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:49:41,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:49:41,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:49:41,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:49:41,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:49:41,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:49:41,927 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:49:41,928 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:49:41,928 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:49:41,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:49:41,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:49:41,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:49:41,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:49:41,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:49:41,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:49:41,928 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:49:41,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:49:41,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:49:41,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:49:41,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:49:41,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:49:41,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:49:41,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:49:41,930 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 -> b88007960cae79b63604455924d89f4d8e6ff83730f3fe3600fe1cad3b333850 [2025-03-16 22:49:42,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:49:42,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:49:42,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:49:42,205 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:49:42,206 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:49:42,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2025-03-16 22:49:43,312 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcfb51fa2/e378bfbfa9e04bc485cdc93dc60d9aae/FLAG8dd92ad82 [2025-03-16 22:49:43,580 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:49:43,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2025-03-16 22:49:43,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcfb51fa2/e378bfbfa9e04bc485cdc93dc60d9aae/FLAG8dd92ad82 [2025-03-16 22:49:43,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcfb51fa2/e378bfbfa9e04bc485cdc93dc60d9aae [2025-03-16 22:49:43,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:49:43,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:49:43,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:49:43,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:49:43,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:49:43,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:49:43" (1/1) ... [2025-03-16 22:49:43,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7554e397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:43, skipping insertion in model container [2025-03-16 22:49:43,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:49:43" (1/1) ... [2025-03-16 22:49:43,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:49:44,031 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.vis_arrays_vsa16a_p5.c[1260,1273] [2025-03-16 22:49:44,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:49:44,254 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:49:44,260 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.vis_arrays_vsa16a_p5.c[1260,1273] [2025-03-16 22:49:44,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:49:44,415 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:49:44,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:44 WrapperNode [2025-03-16 22:49:44,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:49:44,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:49:44,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:49:44,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:49:44,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:44" (1/1) ... [2025-03-16 22:49:44,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:44" (1/1) ... [2025-03-16 22:49:44,844 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4514 [2025-03-16 22:49:44,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:49:44,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:49:44,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:49:44,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:49:44,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:44" (1/1) ... [2025-03-16 22:49:44,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:44" (1/1) ... [2025-03-16 22:49:44,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:44" (1/1) ... [2025-03-16 22:49:45,025 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-16 22:49:45,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:44" (1/1) ... [2025-03-16 22:49:45,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:44" (1/1) ... [2025-03-16 22:49:45,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:44" (1/1) ... [2025-03-16 22:49:45,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:44" (1/1) ... [2025-03-16 22:49:45,133 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:44" (1/1) ... [2025-03-16 22:49:45,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:44" (1/1) ... [2025-03-16 22:49:45,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:49:45,230 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:49:45,230 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:49:45,230 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:49:45,231 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:44" (1/1) ... [2025-03-16 22:49:45,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:49:45,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:49:45,256 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-16 22:49:45,259 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-16 22:49:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:49:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:49:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:49:45,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:49:45,539 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:49:45,541 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:49:48,909 INFO L? ?]: Removed 2687 outVars from TransFormulas that were not future-live. [2025-03-16 22:49:48,910 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:49:49,066 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:49:49,066 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:49:49,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:49:49 BoogieIcfgContainer [2025-03-16 22:49:49,067 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:49:49,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:49:49,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:49:49,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:49:49,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:49:43" (1/3) ... [2025-03-16 22:49:49,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba56223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:49:49, skipping insertion in model container [2025-03-16 22:49:49,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:49:44" (2/3) ... [2025-03-16 22:49:49,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba56223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:49:49, skipping insertion in model container [2025-03-16 22:49:49,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:49:49" (3/3) ... [2025-03-16 22:49:49,075 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2025-03-16 22:49:49,087 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:49:49,089 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsa16a_p5.c that has 1 procedures, 1349 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:49:49,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:49:49,176 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;@6c7a8ec1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:49:49,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:49:49,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 1349 states, 1347 states have (on average 1.5003711952487009) internal successors, (2021), 1348 states have internal predecessors, (2021), 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-16 22:49:49,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 22:49:49,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:49,192 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] [2025-03-16 22:49:49,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:49,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:49,198 INFO L85 PathProgramCache]: Analyzing trace with hash -585449463, now seen corresponding path program 1 times [2025-03-16 22:49:49,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:49,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839980501] [2025-03-16 22:49:49,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:49,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:49,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 22:49:49,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 22:49:49,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:49,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:49,822 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-16 22:49:49,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:49,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839980501] [2025-03-16 22:49:49,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839980501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:49,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:49,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:49:49,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713501632] [2025-03-16 22:49:49,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:49,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:49:49,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:49,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:49:49,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:49:49,849 INFO L87 Difference]: Start difference. First operand has 1349 states, 1347 states have (on average 1.5003711952487009) internal successors, (2021), 1348 states have internal predecessors, (2021), 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 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:50,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:50,507 INFO L93 Difference]: Finished difference Result 2645 states and 3965 transitions. [2025-03-16 22:49:50,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:49:50,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-16 22:49:50,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:50,524 INFO L225 Difference]: With dead ends: 2645 [2025-03-16 22:49:50,524 INFO L226 Difference]: Without dead ends: 1349 [2025-03-16 22:49:50,529 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-16 22:49:50,530 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 0 mSDsluCounter, 3357 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5038 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:50,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5038 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:49:50,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2025-03-16 22:49:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2025-03-16 22:49:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.4985163204747773) internal successors, (2020), 1348 states have internal predecessors, (2020), 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-16 22:49:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 2020 transitions. [2025-03-16 22:49:50,596 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 2020 transitions. Word has length 46 [2025-03-16 22:49:50,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:50,596 INFO L471 AbstractCegarLoop]: Abstraction has 1349 states and 2020 transitions. [2025-03-16 22:49:50,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:50,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 2020 transitions. [2025-03-16 22:49:50,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 22:49:50,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:50,598 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] [2025-03-16 22:49:50,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:49:50,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:50,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:50,599 INFO L85 PathProgramCache]: Analyzing trace with hash -964382826, now seen corresponding path program 1 times [2025-03-16 22:49:50,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:50,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493952031] [2025-03-16 22:49:50,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:50,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:50,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 22:49:50,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 22:49:50,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:50,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:50,795 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-16 22:49:50,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:50,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493952031] [2025-03-16 22:49:50,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493952031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:50,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:50,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:49:50,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865859453] [2025-03-16 22:49:50,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:50,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:49:50,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:50,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:49:50,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:49:50,797 INFO L87 Difference]: Start difference. First operand 1349 states and 2020 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:51,363 INFO L93 Difference]: Finished difference Result 2647 states and 3964 transitions. [2025-03-16 22:49:51,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:49:51,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-16 22:49:51,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:51,368 INFO L225 Difference]: With dead ends: 2647 [2025-03-16 22:49:51,368 INFO L226 Difference]: Without dead ends: 1351 [2025-03-16 22:49:51,370 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-16 22:49:51,371 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 0 mSDsluCounter, 3354 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5035 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:51,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5035 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:49:51,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2025-03-16 22:49:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1351. [2025-03-16 22:49:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1350 states have (on average 1.4977777777777779) internal successors, (2022), 1350 states have internal predecessors, (2022), 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-16 22:49:51,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 2022 transitions. [2025-03-16 22:49:51,402 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 2022 transitions. Word has length 47 [2025-03-16 22:49:51,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:51,402 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 2022 transitions. [2025-03-16 22:49:51,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:51,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2022 transitions. [2025-03-16 22:49:51,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 22:49:51,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:51,404 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] [2025-03-16 22:49:51,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:49:51,404 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:51,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:51,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2100414884, now seen corresponding path program 1 times [2025-03-16 22:49:51,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:51,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010582717] [2025-03-16 22:49:51,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:51,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:51,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-16 22:49:51,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 22:49:51,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:51,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:51,911 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-16 22:49:51,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:51,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010582717] [2025-03-16 22:49:51,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010582717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:51,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:51,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:49:51,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891327438] [2025-03-16 22:49:51,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:51,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:49:51,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:51,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:49:51,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:49:51,912 INFO L87 Difference]: Start difference. First operand 1351 states and 2022 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:52,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:52,620 INFO L93 Difference]: Finished difference Result 2665 states and 3989 transitions. [2025-03-16 22:49:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:49:52,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-16 22:49:52,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:52,625 INFO L225 Difference]: With dead ends: 2665 [2025-03-16 22:49:52,625 INFO L226 Difference]: Without dead ends: 1367 [2025-03-16 22:49:52,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:49:52,627 INFO L435 NwaCegarLoop]: 1679 mSDtfsCounter, 13 mSDsluCounter, 5040 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6719 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:52,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6719 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 22:49:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2025-03-16 22:49:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1364. [2025-03-16 22:49:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1363 states have (on average 1.4966984592809978) internal successors, (2040), 1363 states have internal predecessors, (2040), 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-16 22:49:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2040 transitions. [2025-03-16 22:49:52,648 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2040 transitions. Word has length 48 [2025-03-16 22:49:52,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:52,648 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 2040 transitions. [2025-03-16 22:49:52,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2040 transitions. [2025-03-16 22:49:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 22:49:52,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:52,649 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] [2025-03-16 22:49:52,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:49:52,650 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:52,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:52,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1718250629, now seen corresponding path program 1 times [2025-03-16 22:49:52,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:52,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838269432] [2025-03-16 22:49:52,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:52,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:52,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 22:49:52,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 22:49:52,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:52,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:52,913 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-16 22:49:52,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:52,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838269432] [2025-03-16 22:49:52,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838269432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:52,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:52,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:49:52,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632603085] [2025-03-16 22:49:52,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:52,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:49:52,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:52,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:49:52,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:49:52,915 INFO L87 Difference]: Start difference. First operand 1364 states and 2040 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 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-16 22:49:53,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:53,590 INFO L93 Difference]: Finished difference Result 2922 states and 4366 transitions. [2025-03-16 22:49:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:53,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2025-03-16 22:49:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:53,596 INFO L225 Difference]: With dead ends: 2922 [2025-03-16 22:49:53,596 INFO L226 Difference]: Without dead ends: 1611 [2025-03-16 22:49:53,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:49:53,598 INFO L435 NwaCegarLoop]: 1671 mSDtfsCounter, 2673 mSDsluCounter, 3340 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2673 SdHoareTripleChecker+Valid, 5011 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:53,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2673 Valid, 5011 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:49:53,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2025-03-16 22:49:53,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1376. [2025-03-16 22:49:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1375 states have (on average 1.4952727272727273) internal successors, (2056), 1375 states have internal predecessors, (2056), 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-16 22:49:53,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2056 transitions. [2025-03-16 22:49:53,620 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2056 transitions. Word has length 49 [2025-03-16 22:49:53,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:53,621 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 2056 transitions. [2025-03-16 22:49:53,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 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-16 22:49:53,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2056 transitions. [2025-03-16 22:49:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 22:49:53,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:53,623 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] [2025-03-16 22:49:53,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:49:53,623 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:53,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:53,624 INFO L85 PathProgramCache]: Analyzing trace with hash -777946251, now seen corresponding path program 1 times [2025-03-16 22:49:53,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:53,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291544928] [2025-03-16 22:49:53,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:53,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:53,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 22:49:53,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 22:49:53,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:53,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:53,924 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-16 22:49:53,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:53,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291544928] [2025-03-16 22:49:53,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291544928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:53,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:53,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:49:53,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727886409] [2025-03-16 22:49:53,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:53,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:49:53,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:53,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:49:53,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:49:53,926 INFO L87 Difference]: Start difference. First operand 1376 states and 2056 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:54,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:54,541 INFO L93 Difference]: Finished difference Result 2920 states and 4362 transitions. [2025-03-16 22:49:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:54,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-16 22:49:54,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:54,547 INFO L225 Difference]: With dead ends: 2920 [2025-03-16 22:49:54,547 INFO L226 Difference]: Without dead ends: 1609 [2025-03-16 22:49:54,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:49:54,549 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 2663 mSDsluCounter, 3340 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2663 SdHoareTripleChecker+Valid, 5012 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:54,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2663 Valid, 5012 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:49:54,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2025-03-16 22:49:54,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1386. [2025-03-16 22:49:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1385 states have (on average 1.4931407942238266) internal successors, (2068), 1385 states have internal predecessors, (2068), 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-16 22:49:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2068 transitions. [2025-03-16 22:49:54,574 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2068 transitions. Word has length 50 [2025-03-16 22:49:54,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:54,575 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 2068 transitions. [2025-03-16 22:49:54,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:54,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2068 transitions. [2025-03-16 22:49:54,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 22:49:54,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:54,578 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] [2025-03-16 22:49:54,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:49:54,578 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:54,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:54,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1691420544, now seen corresponding path program 1 times [2025-03-16 22:49:54,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:54,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612701425] [2025-03-16 22:49:54,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:54,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:54,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 22:49:54,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 22:49:54,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:54,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:54,913 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-16 22:49:54,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:54,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612701425] [2025-03-16 22:49:54,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612701425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:54,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:54,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:49:54,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517739521] [2025-03-16 22:49:54,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:54,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:49:54,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:54,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:49:54,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:49:54,915 INFO L87 Difference]: Start difference. First operand 1386 states and 2068 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:55,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:55,919 INFO L93 Difference]: Finished difference Result 2719 states and 4058 transitions. [2025-03-16 22:49:55,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:49:55,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-16 22:49:55,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:55,924 INFO L225 Difference]: With dead ends: 2719 [2025-03-16 22:49:55,924 INFO L226 Difference]: Without dead ends: 1408 [2025-03-16 22:49:55,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:49:55,926 INFO L435 NwaCegarLoop]: 1676 mSDtfsCounter, 5 mSDsluCounter, 10037 mSDsCounter, 0 mSdLazyCounter, 2427 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 11713 SdHoareTripleChecker+Invalid, 2429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:55,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 11713 Invalid, 2429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2427 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 22:49:55,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2025-03-16 22:49:55,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1397. [2025-03-16 22:49:55,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1396 states have (on average 1.4921203438395416) internal successors, (2083), 1396 states have internal predecessors, (2083), 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-16 22:49:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2083 transitions. [2025-03-16 22:49:55,944 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2083 transitions. Word has length 51 [2025-03-16 22:49:55,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:55,944 INFO L471 AbstractCegarLoop]: Abstraction has 1397 states and 2083 transitions. [2025-03-16 22:49:55,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2083 transitions. [2025-03-16 22:49:55,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 22:49:55,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:55,945 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] [2025-03-16 22:49:55,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:49:55,945 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:55,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:55,945 INFO L85 PathProgramCache]: Analyzing trace with hash -205740699, now seen corresponding path program 1 times [2025-03-16 22:49:55,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:55,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764827524] [2025-03-16 22:49:55,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:55,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:55,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 22:49:55,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 22:49:55,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:55,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:56,314 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-16 22:49:56,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:56,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764827524] [2025-03-16 22:49:56,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764827524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:56,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:56,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:49:56,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898644097] [2025-03-16 22:49:56,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:56,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:49:56,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:56,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:49:56,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:49:56,317 INFO L87 Difference]: Start difference. First operand 1397 states and 2083 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:57,022 INFO L93 Difference]: Finished difference Result 2729 states and 4073 transitions. [2025-03-16 22:49:57,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:49:57,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-16 22:49:57,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:57,026 INFO L225 Difference]: With dead ends: 2729 [2025-03-16 22:49:57,026 INFO L226 Difference]: Without dead ends: 1410 [2025-03-16 22:49:57,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:49:57,027 INFO L435 NwaCegarLoop]: 1676 mSDtfsCounter, 11 mSDsluCounter, 8367 mSDsCounter, 0 mSdLazyCounter, 2064 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 10043 SdHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:57,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 10043 Invalid, 2065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2064 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 22:49:57,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2025-03-16 22:49:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1409. [2025-03-16 22:49:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1408 states have (on average 1.4900568181818181) internal successors, (2098), 1408 states have internal predecessors, (2098), 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-16 22:49:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 2098 transitions. [2025-03-16 22:49:57,043 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 2098 transitions. Word has length 51 [2025-03-16 22:49:57,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:57,044 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 2098 transitions. [2025-03-16 22:49:57,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:49:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 2098 transitions. [2025-03-16 22:49:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 22:49:57,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:57,044 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] [2025-03-16 22:49:57,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:49:57,045 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:57,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:57,045 INFO L85 PathProgramCache]: Analyzing trace with hash 741637018, now seen corresponding path program 1 times [2025-03-16 22:49:57,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:57,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671298045] [2025-03-16 22:49:57,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:57,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:57,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 22:49:57,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 22:49:57,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:57,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:57,269 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-16 22:49:57,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:57,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671298045] [2025-03-16 22:49:57,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671298045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:57,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:57,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:49:57,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392035421] [2025-03-16 22:49:57,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:57,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:49:57,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:57,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:49:57,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:49:57,272 INFO L87 Difference]: Start difference. First operand 1409 states and 2098 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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-16 22:49:57,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:57,797 INFO L93 Difference]: Finished difference Result 2753 states and 4103 transitions. [2025-03-16 22:49:57,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:49:57,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2025-03-16 22:49:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:57,801 INFO L225 Difference]: With dead ends: 2753 [2025-03-16 22:49:57,801 INFO L226 Difference]: Without dead ends: 1413 [2025-03-16 22:49:57,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:49:57,803 INFO L435 NwaCegarLoop]: 1678 mSDtfsCounter, 1991 mSDsluCounter, 3348 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1991 SdHoareTripleChecker+Valid, 5026 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:57,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1991 Valid, 5026 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:49:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2025-03-16 22:49:57,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413. [2025-03-16 22:49:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1412 states have (on average 1.4886685552407932) internal successors, (2102), 1412 states have internal predecessors, (2102), 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-16 22:49:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2102 transitions. [2025-03-16 22:49:57,820 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2102 transitions. Word has length 52 [2025-03-16 22:49:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:57,820 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 2102 transitions. [2025-03-16 22:49:57,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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-16 22:49:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2102 transitions. [2025-03-16 22:49:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 22:49:57,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:57,821 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] [2025-03-16 22:49:57,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:49:57,822 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:57,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:57,822 INFO L85 PathProgramCache]: Analyzing trace with hash -303464795, now seen corresponding path program 1 times [2025-03-16 22:49:57,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:57,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108255972] [2025-03-16 22:49:57,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:57,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:57,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 22:49:57,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 22:49:57,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:57,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:58,165 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-16 22:49:58,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:58,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108255972] [2025-03-16 22:49:58,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108255972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:58,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:58,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 22:49:58,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638114541] [2025-03-16 22:49:58,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:58,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:49:58,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:58,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:49:58,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:49:58,166 INFO L87 Difference]: Start difference. First operand 1413 states and 2102 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 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-16 22:49:59,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:49:59,472 INFO L93 Difference]: Finished difference Result 2750 states and 4098 transitions. [2025-03-16 22:49:59,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 22:49:59,473 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 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 53 [2025-03-16 22:49:59,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:49:59,476 INFO L225 Difference]: With dead ends: 2750 [2025-03-16 22:49:59,476 INFO L226 Difference]: Without dead ends: 1420 [2025-03-16 22:49:59,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:49:59,478 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 2010 mSDsluCounter, 11686 mSDsCounter, 0 mSdLazyCounter, 2800 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2010 SdHoareTripleChecker+Valid, 13358 SdHoareTripleChecker+Invalid, 2801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:49:59,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2010 Valid, 13358 Invalid, 2801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2800 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 22:49:59,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2025-03-16 22:49:59,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1417. [2025-03-16 22:49:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1416 states have (on average 1.487994350282486) internal successors, (2107), 1416 states have internal predecessors, (2107), 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-16 22:49:59,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2107 transitions. [2025-03-16 22:49:59,499 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2107 transitions. Word has length 53 [2025-03-16 22:49:59,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:49:59,499 INFO L471 AbstractCegarLoop]: Abstraction has 1417 states and 2107 transitions. [2025-03-16 22:49:59,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 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-16 22:49:59,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2107 transitions. [2025-03-16 22:49:59,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 22:49:59,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:49:59,500 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] [2025-03-16 22:49:59,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 22:49:59,500 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:49:59,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:49:59,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1398270314, now seen corresponding path program 1 times [2025-03-16 22:49:59,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:49:59,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810962984] [2025-03-16 22:49:59,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:49:59,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:49:59,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 22:49:59,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 22:49:59,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:49:59,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:49:59,882 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-16 22:49:59,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:49:59,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810962984] [2025-03-16 22:49:59,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810962984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:49:59,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:49:59,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 22:49:59,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650685013] [2025-03-16 22:49:59,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:49:59,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 22:49:59,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:49:59,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 22:49:59,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:49:59,883 INFO L87 Difference]: Start difference. First operand 1417 states and 2107 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 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-16 22:50:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:01,171 INFO L93 Difference]: Finished difference Result 3005 states and 4470 transitions. [2025-03-16 22:50:01,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 22:50:01,171 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 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 53 [2025-03-16 22:50:01,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:01,175 INFO L225 Difference]: With dead ends: 3005 [2025-03-16 22:50:01,175 INFO L226 Difference]: Without dead ends: 1671 [2025-03-16 22:50:01,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-03-16 22:50:01,177 INFO L435 NwaCegarLoop]: 1662 mSDtfsCounter, 2697 mSDsluCounter, 14946 mSDsCounter, 0 mSdLazyCounter, 3571 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2697 SdHoareTripleChecker+Valid, 16608 SdHoareTripleChecker+Invalid, 3572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:01,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2697 Valid, 16608 Invalid, 3572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3571 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 22:50:01,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2025-03-16 22:50:01,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1429. [2025-03-16 22:50:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1428 states have (on average 1.4866946778711485) internal successors, (2123), 1428 states have internal predecessors, (2123), 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-16 22:50:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 2123 transitions. [2025-03-16 22:50:01,194 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 2123 transitions. Word has length 53 [2025-03-16 22:50:01,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:01,194 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 2123 transitions. [2025-03-16 22:50:01,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 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-16 22:50:01,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2123 transitions. [2025-03-16 22:50:01,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 22:50:01,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:01,195 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] [2025-03-16 22:50:01,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 22:50:01,195 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:01,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:01,195 INFO L85 PathProgramCache]: Analyzing trace with hash 941575801, now seen corresponding path program 1 times [2025-03-16 22:50:01,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:01,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211585316] [2025-03-16 22:50:01,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:01,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:01,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 22:50:01,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 22:50:01,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:01,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:01,393 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-16 22:50:01,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:01,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211585316] [2025-03-16 22:50:01,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211585316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:01,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:01,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:50:01,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262651447] [2025-03-16 22:50:01,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:01,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:50:01,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:01,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:50:01,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:50:01,394 INFO L87 Difference]: Start difference. First operand 1429 states and 2123 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-16 22:50:02,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:02,256 INFO L93 Difference]: Finished difference Result 2766 states and 4120 transitions. [2025-03-16 22:50:02,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:50:02,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 53 [2025-03-16 22:50:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:02,260 INFO L225 Difference]: With dead ends: 2766 [2025-03-16 22:50:02,260 INFO L226 Difference]: Without dead ends: 1432 [2025-03-16 22:50:02,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:50:02,261 INFO L435 NwaCegarLoop]: 1676 mSDtfsCounter, 11 mSDsluCounter, 8351 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 10027 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:02,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 10027 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 22:50:02,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2025-03-16 22:50:02,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1432. [2025-03-16 22:50:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1431 states have (on average 1.485674353598882) internal successors, (2126), 1431 states have internal predecessors, (2126), 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-16 22:50:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2126 transitions. [2025-03-16 22:50:02,274 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2126 transitions. Word has length 53 [2025-03-16 22:50:02,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:02,274 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 2126 transitions. [2025-03-16 22:50:02,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-16 22:50:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2126 transitions. [2025-03-16 22:50:02,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 22:50:02,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:02,275 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] [2025-03-16 22:50:02,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 22:50:02,275 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:02,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:02,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1967035029, now seen corresponding path program 1 times [2025-03-16 22:50:02,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:02,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494251520] [2025-03-16 22:50:02,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:02,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:02,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 22:50:02,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 22:50:02,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:02,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:02,491 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-16 22:50:02,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:02,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494251520] [2025-03-16 22:50:02,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494251520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:02,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:02,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:50:02,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990495464] [2025-03-16 22:50:02,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:02,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:50:02,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:02,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:50:02,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:50:02,494 INFO L87 Difference]: Start difference. First operand 1432 states and 2126 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-16 22:50:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:03,034 INFO L93 Difference]: Finished difference Result 2930 states and 4354 transitions. [2025-03-16 22:50:03,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:50:03,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 54 [2025-03-16 22:50:03,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:03,037 INFO L225 Difference]: With dead ends: 2930 [2025-03-16 22:50:03,038 INFO L226 Difference]: Without dead ends: 1575 [2025-03-16 22:50:03,039 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-16 22:50:03,039 INFO L435 NwaCegarLoop]: 1671 mSDtfsCounter, 220 mSDsluCounter, 3335 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 5006 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:03,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 5006 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:50:03,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2025-03-16 22:50:03,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1414. [2025-03-16 22:50:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1413 states have (on average 1.4876150035385705) internal successors, (2102), 1413 states have internal predecessors, (2102), 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-16 22:50:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2102 transitions. [2025-03-16 22:50:03,054 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2102 transitions. Word has length 54 [2025-03-16 22:50:03,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:03,054 INFO L471 AbstractCegarLoop]: Abstraction has 1414 states and 2102 transitions. [2025-03-16 22:50:03,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-16 22:50:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2102 transitions. [2025-03-16 22:50:03,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 22:50:03,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:03,056 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] [2025-03-16 22:50:03,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 22:50:03,056 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:03,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:03,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1012443462, now seen corresponding path program 1 times [2025-03-16 22:50:03,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:03,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432795020] [2025-03-16 22:50:03,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:03,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:03,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 22:50:03,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 22:50:03,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:03,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:03,255 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-16 22:50:03,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:03,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432795020] [2025-03-16 22:50:03,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432795020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:03,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:03,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:50:03,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951767825] [2025-03-16 22:50:03,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:03,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:50:03,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:03,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:50:03,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:03,256 INFO L87 Difference]: Start difference. First operand 1414 states and 2102 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 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-16 22:50:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:03,967 INFO L93 Difference]: Finished difference Result 3042 states and 4526 transitions. [2025-03-16 22:50:03,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:50:03,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 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 54 [2025-03-16 22:50:03,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:03,971 INFO L225 Difference]: With dead ends: 3042 [2025-03-16 22:50:03,971 INFO L226 Difference]: Without dead ends: 1696 [2025-03-16 22:50:03,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:50:03,972 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 2858 mSDsluCounter, 4990 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2858 SdHoareTripleChecker+Valid, 6657 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:03,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2858 Valid, 6657 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 22:50:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2025-03-16 22:50:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1403. [2025-03-16 22:50:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1403 states, 1402 states have (on average 1.4900142653352353) internal successors, (2089), 1402 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-16 22:50:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 2089 transitions. [2025-03-16 22:50:03,985 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 2089 transitions. Word has length 54 [2025-03-16 22:50:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:03,986 INFO L471 AbstractCegarLoop]: Abstraction has 1403 states and 2089 transitions. [2025-03-16 22:50:03,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 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-16 22:50:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 2089 transitions. [2025-03-16 22:50:03,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 22:50:03,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:03,986 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] [2025-03-16 22:50:03,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 22:50:03,987 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:03,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:03,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1689519456, now seen corresponding path program 1 times [2025-03-16 22:50:03,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:03,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673871589] [2025-03-16 22:50:03,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:03,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:04,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 22:50:04,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 22:50:04,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:04,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:04,578 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-16 22:50:04,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:04,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673871589] [2025-03-16 22:50:04,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673871589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:04,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:04,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 22:50:04,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051159491] [2025-03-16 22:50:04,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:04,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 22:50:04,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:04,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 22:50:04,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:50:04,579 INFO L87 Difference]: Start difference. First operand 1403 states and 2089 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 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-16 22:50:05,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:05,960 INFO L93 Difference]: Finished difference Result 2965 states and 4414 transitions. [2025-03-16 22:50:05,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 22:50:05,961 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 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 55 [2025-03-16 22:50:05,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:05,964 INFO L225 Difference]: With dead ends: 2965 [2025-03-16 22:50:05,964 INFO L226 Difference]: Without dead ends: 1628 [2025-03-16 22:50:05,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2025-03-16 22:50:05,966 INFO L435 NwaCegarLoop]: 1664 mSDtfsCounter, 2656 mSDsluCounter, 13552 mSDsCounter, 0 mSdLazyCounter, 3285 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2656 SdHoareTripleChecker+Valid, 15216 SdHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:05,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2656 Valid, 15216 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3285 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 22:50:05,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2025-03-16 22:50:05,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1408. [2025-03-16 22:50:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1407 states have (on average 1.4896943852167732) internal successors, (2096), 1407 states have internal predecessors, (2096), 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-16 22:50:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 2096 transitions. [2025-03-16 22:50:05,979 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 2096 transitions. Word has length 55 [2025-03-16 22:50:05,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:05,979 INFO L471 AbstractCegarLoop]: Abstraction has 1408 states and 2096 transitions. [2025-03-16 22:50:05,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 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-16 22:50:05,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 2096 transitions. [2025-03-16 22:50:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 22:50:05,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:05,980 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] [2025-03-16 22:50:05,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 22:50:05,980 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:05,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:05,980 INFO L85 PathProgramCache]: Analyzing trace with hash 222419599, now seen corresponding path program 1 times [2025-03-16 22:50:05,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:05,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444395419] [2025-03-16 22:50:05,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:05,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:06,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 22:50:06,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 22:50:06,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:06,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:50:06,047 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:50:06,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 22:50:06,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 22:50:06,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:06,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:50:06,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:50:06,148 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:50:06,149 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:50:06,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 22:50:06,153 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:06,200 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 22:50:06,213 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:50:06,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:50:06 BoogieIcfgContainer [2025-03-16 22:50:06,217 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:50:06,218 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:50:06,218 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:50:06,218 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:50:06,219 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:49:49" (3/4) ... [2025-03-16 22:50:06,220 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:50:06,221 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:50:06,221 INFO L158 Benchmark]: Toolchain (without parser) took 22354.95ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 110.4MB in the beginning and 287.4MB in the end (delta: -176.9MB). Peak memory consumption was 164.2MB. Max. memory is 16.1GB. [2025-03-16 22:50:06,221 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:50:06,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.39ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 89.4MB in the end (delta: 21.0MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. [2025-03-16 22:50:06,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 431.30ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 89.4MB in the beginning and 251.0MB in the end (delta: -161.6MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. [2025-03-16 22:50:06,222 INFO L158 Benchmark]: Boogie Preprocessor took 379.26ms. Allocated memory is still 369.1MB. Free memory was 251.0MB in the beginning and 220.6MB in the end (delta: 30.4MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2025-03-16 22:50:06,222 INFO L158 Benchmark]: IcfgBuilder took 3837.29ms. Allocated memory was 369.1MB in the beginning and 738.2MB in the end (delta: 369.1MB). Free memory was 220.6MB in the beginning and 523.5MB in the end (delta: -302.9MB). Peak memory consumption was 186.0MB. Max. memory is 16.1GB. [2025-03-16 22:50:06,222 INFO L158 Benchmark]: TraceAbstraction took 17148.56ms. Allocated memory was 738.2MB in the beginning and 478.2MB in the end (delta: -260.0MB). Free memory was 523.5MB in the beginning and 287.4MB in the end (delta: 236.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:50:06,222 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 478.2MB. Free memory was 287.4MB in the beginning and 287.4MB in the end (delta: 25.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:50:06,223 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.23ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 549.39ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 89.4MB in the end (delta: 21.0MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 431.30ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 89.4MB in the beginning and 251.0MB in the end (delta: -161.6MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 379.26ms. Allocated memory is still 369.1MB. Free memory was 251.0MB in the beginning and 220.6MB in the end (delta: 30.4MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. * IcfgBuilder took 3837.29ms. Allocated memory was 369.1MB in the beginning and 738.2MB in the end (delta: 369.1MB). Free memory was 220.6MB in the beginning and 523.5MB in the end (delta: -302.9MB). Peak memory consumption was 186.0MB. Max. memory is 16.1GB. * TraceAbstraction took 17148.56ms. Allocated memory was 738.2MB in the beginning and 478.2MB in the end (delta: -260.0MB). Free memory was 523.5MB in the beginning and 287.4MB in the end (delta: 236.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 478.2MB. Free memory was 287.4MB in the beginning and 287.4MB in the end (delta: 25.6kB). Peak memory consumption was 8.4MB. 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 bitwiseOr at line 201, overapproximation of bitwiseOr at line 215, overapproximation of bitwiseAnd at line 220, overapproximation of bitwiseAnd at line 212. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L32] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 3); [L33] const SORT_9 msb_SORT_9 = (SORT_9)1 << (3 - 1); [L35] const SORT_44 mask_SORT_44 = (SORT_44)-1 >> (sizeof(SORT_44) * 8 - 12); [L36] const SORT_44 msb_SORT_44 = (SORT_44)1 << (12 - 1); [L38] const SORT_98 mask_SORT_98 = (SORT_98)-1 >> (sizeof(SORT_98) * 8 - 17); [L39] const SORT_98 msb_SORT_98 = (SORT_98)1 << (17 - 1); [L41] const SORT_99 mask_SORT_99 = (SORT_99)-1 >> (sizeof(SORT_99) * 8 - 5); [L42] const SORT_99 msb_SORT_99 = (SORT_99)1 << (5 - 1); [L44] const SORT_102 mask_SORT_102 = (SORT_102)-1 >> (sizeof(SORT_102) * 8 - 9); [L45] const SORT_102 msb_SORT_102 = (SORT_102)1 << (9 - 1); [L47] const SORT_104 mask_SORT_104 = (SORT_104)-1 >> (sizeof(SORT_104) * 8 - 10); [L48] const SORT_104 msb_SORT_104 = (SORT_104)1 << (10 - 1); [L50] const SORT_107 mask_SORT_107 = (SORT_107)-1 >> (sizeof(SORT_107) * 8 - 11); [L51] const SORT_107 msb_SORT_107 = (SORT_107)1 << (11 - 1); [L53] const SORT_112 mask_SORT_112 = (SORT_112)-1 >> (sizeof(SORT_112) * 8 - 13); [L54] const SORT_112 msb_SORT_112 = (SORT_112)1 << (13 - 1); [L56] const SORT_115 mask_SORT_115 = (SORT_115)-1 >> (sizeof(SORT_115) * 8 - 14); [L57] const SORT_115 msb_SORT_115 = (SORT_115)1 << (14 - 1); [L59] const SORT_118 mask_SORT_118 = (SORT_118)-1 >> (sizeof(SORT_118) * 8 - 15); [L60] const SORT_118 msb_SORT_118 = (SORT_118)1 << (15 - 1); [L62] const SORT_151 mask_SORT_151 = (SORT_151)-1 >> (sizeof(SORT_151) * 8 - 7); [L63] const SORT_151 msb_SORT_151 = (SORT_151)1 << (7 - 1); [L65] const SORT_211 mask_SORT_211 = (SORT_211)-1 >> (sizeof(SORT_211) * 8 - 2); [L66] const SORT_211 msb_SORT_211 = (SORT_211)1 << (2 - 1); [L68] const SORT_370 mask_SORT_370 = (SORT_370)-1 >> (sizeof(SORT_370) * 8 - 4); [L69] const SORT_370 msb_SORT_370 = (SORT_370)1 << (4 - 1); [L71] const SORT_373 mask_SORT_373 = (SORT_373)-1 >> (sizeof(SORT_373) * 8 - 6); [L72] const SORT_373 msb_SORT_373 = (SORT_373)1 << (6 - 1); [L74] const SORT_376 mask_SORT_376 = (SORT_376)-1 >> (sizeof(SORT_376) * 8 - 8); [L75] const SORT_376 msb_SORT_376 = (SORT_376)1 << (8 - 1); [L77] const SORT_3 var_6 = 0; [L78] const SORT_9 var_11 = 2; [L79] const SORT_9 var_13 = 0; [L80] const SORT_1 var_19 = 0; [L81] const SORT_1 var_34 = 1; [L82] const SORT_44 var_45 = 0; [L83] const SORT_9 var_61 = 1; [L84] const SORT_9 var_66 = 4; [L85] const SORT_9 var_68 = 5; [L86] const SORT_9 var_72 = 3; [L87] const SORT_99 var_100 = 0; [L88] const SORT_151 var_153 = 5; [L89] const SORT_151 var_157 = 4; [L90] const SORT_151 var_161 = 3; [L91] const SORT_151 var_165 = 2; [L92] const SORT_151 var_169 = 1; [L93] const SORT_151 var_173 = 0; [L94] const SORT_44 var_196 = 2; [L95] const SORT_211 var_213 = 0; [L96] const SORT_3 var_220 = 65535; [L98] SORT_1 input_2; [L99] SORT_3 input_4; [L100] SORT_3 input_5; [L101] SORT_3 input_208; [L102] SORT_3 input_209; [L103] SORT_3 input_210; [L104] SORT_3 input_219; [L105] SORT_3 input_228; [L106] SORT_3 input_229; [L107] SORT_3 input_230; [L108] SORT_3 input_233; [L109] SORT_3 input_251; [L110] SORT_3 input_252; [L111] SORT_3 input_253; [L112] SORT_3 input_256; [L113] SORT_3 input_258; [L114] SORT_211 input_272; [L115] SORT_211 input_273; [L116] SORT_211 input_274; [L118] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L118] SORT_3 state_7 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_9 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L119] SORT_9 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_9; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L120] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L121] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L121] SORT_3 state_23 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L122] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L122] SORT_3 state_38 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L123] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L123] SORT_3 state_40 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L124] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L124] SORT_3 state_42 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L125] EXPR __VERIFIER_nondet_ushort() & mask_SORT_44 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L125] SORT_44 state_46 = __VERIFIER_nondet_ushort() & mask_SORT_44; [L126] EXPR __VERIFIER_nondet_ushort() & mask_SORT_44 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L126] SORT_44 state_48 = __VERIFIER_nondet_ushort() & mask_SORT_44; [L127] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L127] SORT_3 state_50 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L128] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L128] SORT_3 state_52 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L129] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L129] SORT_3 state_54 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L130] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L130] SORT_3 state_56 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L132] SORT_3 init_8_arg_1 = var_6; [L133] state_7 = init_8_arg_1 [L134] SORT_9 init_15_arg_1 = var_13; [L135] state_14 = init_15_arg_1 [L136] SORT_1 init_21_arg_1 = var_19; [L137] state_20 = init_21_arg_1 [L138] SORT_3 init_24_arg_1 = var_6; [L139] state_23 = init_24_arg_1 [L140] SORT_3 init_39_arg_1 = var_6; [L141] state_38 = init_39_arg_1 [L142] SORT_3 init_41_arg_1 = var_6; [L143] state_40 = init_41_arg_1 [L144] SORT_3 init_43_arg_1 = var_6; [L145] state_42 = init_43_arg_1 [L146] SORT_44 init_47_arg_1 = var_45; [L147] state_46 = init_47_arg_1 [L148] SORT_44 init_49_arg_1 = var_45; [L149] state_48 = init_49_arg_1 [L150] SORT_3 init_51_arg_1 = var_6; [L151] state_50 = init_51_arg_1 [L152] SORT_3 init_53_arg_1 = var_6; [L153] state_52 = init_53_arg_1 [L154] SORT_3 init_55_arg_1 = var_6; [L155] state_54 = init_55_arg_1 [L156] SORT_3 init_57_arg_1 = var_6; [L157] state_56 = init_57_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L160] input_2 = __VERIFIER_nondet_uchar() [L161] input_4 = __VERIFIER_nondet_ushort() [L162] input_5 = __VERIFIER_nondet_ushort() [L163] input_208 = __VERIFIER_nondet_ushort() [L164] input_209 = __VERIFIER_nondet_ushort() [L165] input_210 = __VERIFIER_nondet_ushort() [L166] input_219 = __VERIFIER_nondet_ushort() [L167] input_228 = __VERIFIER_nondet_ushort() [L168] input_229 = __VERIFIER_nondet_ushort() [L169] input_230 = __VERIFIER_nondet_ushort() [L170] input_233 = __VERIFIER_nondet_ushort() [L171] input_251 = __VERIFIER_nondet_ushort() [L172] input_252 = __VERIFIER_nondet_ushort() [L173] input_253 = __VERIFIER_nondet_ushort() [L174] input_256 = __VERIFIER_nondet_ushort() [L175] input_258 = __VERIFIER_nondet_ushort() [L176] input_272 = __VERIFIER_nondet_uchar() [L177] input_273 = __VERIFIER_nondet_uchar() [L178] input_274 = __VERIFIER_nondet_uchar() [L181] SORT_3 var_10_arg_0 = state_7; [L182] SORT_9 var_10 = var_10_arg_0 >> 0; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L183] EXPR var_10 & mask_SORT_9 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L183] var_10 = var_10 & mask_SORT_9 [L184] SORT_9 var_12_arg_0 = var_10; [L185] SORT_9 var_12_arg_1 = var_11; [L186] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L187] SORT_9 var_16_arg_0 = state_14; [L188] SORT_1 var_16 = var_16_arg_0 >> 2; [L189] SORT_1 var_17_arg_0 = var_12; [L190] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_17_arg_0=0, var_17_arg_1=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L191] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L191] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L192] SORT_1 var_18_arg_0 = var_17; [L193] SORT_1 var_18 = ~var_18_arg_0; [L194] SORT_1 var_22_arg_0 = state_20; [L195] SORT_1 var_22 = ~var_22_arg_0; [L196] SORT_3 var_25_arg_0 = state_23; [L197] SORT_3 var_25_arg_1 = var_6; [L198] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L199] SORT_1 var_26_arg_0 = var_22; [L200] SORT_1 var_26_arg_1 = var_25; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_26_arg_0=-1, var_26_arg_1=1, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L201] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L201] SORT_1 var_26 = var_26_arg_0 | var_26_arg_1; [L202] SORT_3 var_27_arg_0 = state_23; [L203] SORT_3 var_27_arg_1 = var_6; [L204] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L205] SORT_1 var_28_arg_0 = var_27; [L206] SORT_1 var_28 = ~var_28_arg_0; [L207] SORT_1 var_29_arg_0 = var_28; [L208] SORT_1 var_29_arg_1 = state_20; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_26=255, var_29_arg_0=-2, var_29_arg_1=0, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L209] EXPR var_29_arg_0 | var_29_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_26=255, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L209] SORT_1 var_29 = var_29_arg_0 | var_29_arg_1; [L210] SORT_1 var_30_arg_0 = var_26; [L211] SORT_1 var_30_arg_1 = var_29; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_30_arg_0=255, var_30_arg_1=254, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L212] EXPR var_30_arg_0 & var_30_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L212] SORT_1 var_30 = var_30_arg_0 & var_30_arg_1; [L213] SORT_1 var_31_arg_0 = var_18; [L214] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_31_arg_0=-1, var_31_arg_1=253, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L215] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L215] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L216] SORT_1 var_35_arg_0 = var_31; [L217] SORT_1 var_35 = ~var_35_arg_0; [L218] SORT_1 var_36_arg_0 = var_34; [L219] SORT_1 var_36_arg_1 = var_35; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_36_arg_0=1, var_36_arg_1=-1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L220] EXPR var_36_arg_0 & var_36_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L220] SORT_1 var_36 = var_36_arg_0 & var_36_arg_1; [L221] EXPR var_36 & mask_SORT_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L221] var_36 = var_36 & mask_SORT_1 [L222] SORT_1 bad_37_arg_0 = var_36; [L223] CALL __VERIFIER_assert(!(bad_37_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1349 locations, 2021 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17808 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17808 mSDsluCounter, 120469 SdHoareTripleChecker+Invalid, 8.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97043 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25186 IncrementalHoareTripleChecker+Invalid, 25197 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 23426 mSDtfsCounter, 25186 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1432occurred in iteration=11, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 1392 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 772 NumberOfCodeBlocks, 772 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 702 ConstructedInterpolants, 0 QuantifiedInterpolants, 2049 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-16 22:50:06,242 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.vis_arrays_vsa16a_p5.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 b88007960cae79b63604455924d89f4d8e6ff83730f3fe3600fe1cad3b333850 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:50:08,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:50:08,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 22:50:08,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:50:08,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:50:08,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:50:08,144 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:50:08,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:50:08,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:50:08,145 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:50:08,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:50:08,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:50:08,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:50:08,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:50:08,147 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:50:08,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:50:08,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:50:08,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:50:08,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:50:08,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:50:08,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:50:08,147 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:50:08,147 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:50:08,147 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:50:08,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:50:08,147 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:50:08,147 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:50:08,147 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:50:08,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:50:08,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:50:08,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:50:08,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:50:08,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:50:08,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:50:08,148 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:50:08,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:50:08,148 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:50:08,148 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:50:08,148 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:50:08,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:50:08,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:50:08,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:50:08,148 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 -> b88007960cae79b63604455924d89f4d8e6ff83730f3fe3600fe1cad3b333850 [2025-03-16 22:50:08,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:50:08,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:50:08,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:50:08,374 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:50:08,374 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:50:08,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2025-03-16 22:50:09,541 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad0167dd/c3dd6be5b3ec4107adcde81ac049f74b/FLAG10438f400 [2025-03-16 22:50:09,861 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:50:09,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2025-03-16 22:50:09,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad0167dd/c3dd6be5b3ec4107adcde81ac049f74b/FLAG10438f400 [2025-03-16 22:50:09,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad0167dd/c3dd6be5b3ec4107adcde81ac049f74b [2025-03-16 22:50:09,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:50:09,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:50:09,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:50:09,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:50:09,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:50:09,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:50:09" (1/1) ... [2025-03-16 22:50:09,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198bf93f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:09, skipping insertion in model container [2025-03-16 22:50:09,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:50:09" (1/1) ... [2025-03-16 22:50:09,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:50:10,089 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.vis_arrays_vsa16a_p5.c[1260,1273] [2025-03-16 22:50:10,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:50:10,319 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:50:10,327 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.vis_arrays_vsa16a_p5.c[1260,1273] [2025-03-16 22:50:10,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:50:10,446 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:50:10,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:10 WrapperNode [2025-03-16 22:50:10,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:50:10,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:50:10,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:50:10,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:50:10,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:10" (1/1) ... [2025-03-16 22:50:10,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:10" (1/1) ... [2025-03-16 22:50:10,548 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1832 [2025-03-16 22:50:10,549 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:50:10,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:50:10,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:50:10,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:50:10,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:10" (1/1) ... [2025-03-16 22:50:10,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:10" (1/1) ... [2025-03-16 22:50:10,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:10" (1/1) ... [2025-03-16 22:50:10,599 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-16 22:50:10,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:10" (1/1) ... [2025-03-16 22:50:10,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:10" (1/1) ... [2025-03-16 22:50:10,627 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:10" (1/1) ... [2025-03-16 22:50:10,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:10" (1/1) ... [2025-03-16 22:50:10,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:10" (1/1) ... [2025-03-16 22:50:10,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:10" (1/1) ... [2025-03-16 22:50:10,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:50:10,671 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:50:10,671 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:50:10,671 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:50:10,672 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:10" (1/1) ... [2025-03-16 22:50:10,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:50:10,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:50:10,695 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-16 22:50:10,698 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-16 22:50:10,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:50:10,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:50:10,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:50:10,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:50:10,976 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:50:10,977 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:50:12,542 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2025-03-16 22:50:12,542 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:50:12,548 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:50:12,548 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:50:12,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:50:12 BoogieIcfgContainer [2025-03-16 22:50:12,548 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:50:12,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:50:12,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:50:12,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:50:12,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:50:09" (1/3) ... [2025-03-16 22:50:12,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38851e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:50:12, skipping insertion in model container [2025-03-16 22:50:12,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:10" (2/3) ... [2025-03-16 22:50:12,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38851e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:50:12, skipping insertion in model container [2025-03-16 22:50:12,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:50:12" (3/3) ... [2025-03-16 22:50:12,556 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2025-03-16 22:50:12,565 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:50:12,566 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsa16a_p5.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:50:12,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:50:12,604 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;@7aba8bec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:50:12,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:50:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 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-16 22:50:12,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 22:50:12,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:12,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 22:50:12,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:12,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:12,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 22:50:12,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:50:12,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1631814053] [2025-03-16 22:50:12,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:12,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:50:12,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:50:12,629 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-16 22:50:12,631 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-16 22:50:12,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 22:50:12,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 22:50:12,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:12,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:12,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 22:50:12,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:50:13,063 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-16 22:50:13,064 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:50:13,065 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:50:13,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631814053] [2025-03-16 22:50:13,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631814053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:13,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:13,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:50:13,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690225843] [2025-03-16 22:50:13,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:13,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:50:13,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:50:13,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:50:13,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:50:13,083 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 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) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-16 22:50:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:13,169 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-16 22:50:13,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:50:13,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-03-16 22:50:13,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:13,174 INFO L225 Difference]: With dead ends: 16 [2025-03-16 22:50:13,174 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 22:50:13,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:13,177 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 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-16 22:50:13,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:50:13,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 22:50:13,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-16 22:50:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-16 22:50:13,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 22:50:13,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 22:50:13,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:13,196 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 22:50:13,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-16 22:50:13,196 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 22:50:13,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 22:50:13,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:13,196 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 22:50:13,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 22:50:13,397 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-16 22:50:13,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:13,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:13,397 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 22:50:13,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:50:13,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1943204853] [2025-03-16 22:50:13,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:13,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:50:13,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:50:13,401 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-16 22:50:13,401 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-16 22:50:13,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 22:50:13,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 22:50:13,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:13,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:13,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-16 22:50:13,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:50:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:13,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:50:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:14,142 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:50:14,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943204853] [2025-03-16 22:50:14,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943204853] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:50:14,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:50:14,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-16 22:50:14,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525279328] [2025-03-16 22:50:14,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 22:50:14,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:50:14,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:50:14,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:50:14,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:50:14,144 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:14,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:14,574 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-03-16 22:50:14,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:50:14,574 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-16 22:50:14,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:14,575 INFO L225 Difference]: With dead ends: 17 [2025-03-16 22:50:14,575 INFO L226 Difference]: Without dead ends: 15 [2025-03-16 22:50:14,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-03-16 22:50:14,576 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:14,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 13 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:50:14,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-16 22:50:14,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-03-16 22:50:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-16 22:50:14,582 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2025-03-16 22:50:14,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:14,582 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-16 22:50:14,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-16 22:50:14,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 22:50:14,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:14,583 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2025-03-16 22:50:14,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 22:50:14,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:50:14,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:14,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:14,785 INFO L85 PathProgramCache]: Analyzing trace with hash 852005001, now seen corresponding path program 2 times [2025-03-16 22:50:14,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:50:14,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1385030573] [2025-03-16 22:50:14,787 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 22:50:14,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:50:14,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:50:14,789 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:50:14,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 22:50:15,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-16 22:50:15,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 22:50:15,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 22:50:15,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:15,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-16 22:50:15,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:50:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:15,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:50:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:16,324 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:50:16,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385030573] [2025-03-16 22:50:16,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385030573] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:50:16,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:50:16,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-16 22:50:16,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180715347] [2025-03-16 22:50:16,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 22:50:16,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 22:50:16,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:50:16,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 22:50:16,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:50:16,326 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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-16 22:50:17,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:17,420 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2025-03-16 22:50:17,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 22:50:17,421 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-16 22:50:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:17,421 INFO L225 Difference]: With dead ends: 31 [2025-03-16 22:50:17,422 INFO L226 Difference]: Without dead ends: 29 [2025-03-16 22:50:17,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-16 22:50:17,423 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:17,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:50:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-16 22:50:17,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2025-03-16 22:50:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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-16 22:50:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2025-03-16 22:50:17,431 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 13 [2025-03-16 22:50:17,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:17,431 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-03-16 22:50:17,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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-16 22:50:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2025-03-16 22:50:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 22:50:17,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:17,432 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2025-03-16 22:50:17,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 22:50:17,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:50:17,633 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:17,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:17,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1174864737, now seen corresponding path program 3 times [2025-03-16 22:50:17,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:50:17,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [669995271] [2025-03-16 22:50:17,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 22:50:17,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:50:17,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:50:17,636 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:50:17,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 22:50:18,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 5 equivalence classes. [2025-03-16 22:50:18,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 22:50:18,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-16 22:50:18,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:18,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-03-16 22:50:18,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:50:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:28,474 INFO L312 TraceCheckSpWp]: Computing backward predicates...