./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 5335ff3ae60d503c7989a0baf091bf4ee05fe6735e77308a3563d234056465f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 18:06:37,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 18:06:37,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 18:06:37,575 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 18:06:37,576 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 18:06:37,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 18:06:37,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 18:06:37,602 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 18:06:37,602 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 18:06:37,602 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 18:06:37,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 18:06:37,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 18:06:37,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 18:06:37,603 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 18:06:37,603 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 18:06:37,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 18:06:37,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 18:06:37,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 18:06:37,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 18:06:37,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 18:06:37,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 18:06:37,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 18:06:37,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 18:06:37,604 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 18:06:37,604 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 18:06:37,604 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 18:06:37,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 18:06:37,604 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 18:06:37,604 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 18:06:37,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:06:37,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 18:06:37,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 18:06:37,605 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 18:06:37,605 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 18:06:37,605 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 18:06:37,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 18:06:37,605 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 18:06:37,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 18:06:37,606 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 18:06:37,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 18:06:37,606 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-jdk21/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 -> 5335ff3ae60d503c7989a0baf091bf4ee05fe6735e77308a3563d234056465f1 [2025-02-05 18:06:37,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 18:06:37,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 18:06:37,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 18:06:37,966 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 18:06:37,966 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 18:06:37,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c [2025-02-05 18:06:39,366 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b89a734ac/a429d8377481450f8d087a4fd61d0670/FLAGfede1dddb [2025-02-05 18:06:39,743 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 18:06:39,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c [2025-02-05 18:06:39,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b89a734ac/a429d8377481450f8d087a4fd61d0670/FLAGfede1dddb [2025-02-05 18:06:39,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b89a734ac/a429d8377481450f8d087a4fd61d0670 [2025-02-05 18:06:39,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 18:06:39,797 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 18:06:39,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 18:06:39,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 18:06:39,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 18:06:39,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:06:39" (1/1) ... [2025-02-05 18:06:39,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ab6c762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:06:39, skipping insertion in model container [2025-02-05 18:06:39,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:06:39" (1/1) ... [2025-02-05 18:06:39,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 18:06:40,031 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c[1175,1188] [2025-02-05 18:06:40,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:06:40,304 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 18:06:40,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c[1175,1188] [2025-02-05 18:06:40,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:06:40,464 INFO L204 MainTranslator]: Completed translation [2025-02-05 18:06:40,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:06:40 WrapperNode [2025-02-05 18:06:40,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 18:06:40,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 18:06:40,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 18:06:40,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 18:06:40,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:06:40" (1/1) ... [2025-02-05 18:06:40,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:06:40" (1/1) ... [2025-02-05 18:06:41,020 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3196 [2025-02-05 18:06:41,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 18:06:41,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 18:06:41,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 18:06:41,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 18:06:41,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:06:40" (1/1) ... [2025-02-05 18:06:41,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:06:40" (1/1) ... [2025-02-05 18:06:41,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:06:40" (1/1) ... [2025-02-05 18:06:41,285 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-02-05 18:06:41,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:06:40" (1/1) ... [2025-02-05 18:06:41,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:06:40" (1/1) ... [2025-02-05 18:06:41,419 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:06:40" (1/1) ... [2025-02-05 18:06:41,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:06:40" (1/1) ... [2025-02-05 18:06:41,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:06:40" (1/1) ... [2025-02-05 18:06:41,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:06:40" (1/1) ... [2025-02-05 18:06:41,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 18:06:41,594 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 18:06:41,594 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 18:06:41,594 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 18:06:41,595 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:06:40" (1/1) ... [2025-02-05 18:06:41,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:06:41,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:06:41,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 18:06:41,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 18:06:41,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 18:06:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 18:06:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 18:06:41,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 18:06:41,910 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 18:06:41,912 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 18:06:45,799 INFO L? ?]: Removed 1718 outVars from TransFormulas that were not future-live. [2025-02-05 18:06:45,800 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 18:06:45,988 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 18:06:45,989 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 18:06:45,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:06:45 BoogieIcfgContainer [2025-02-05 18:06:45,989 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 18:06:45,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 18:06:45,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 18:06:46,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 18:06:46,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 06:06:39" (1/3) ... [2025-02-05 18:06:46,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7d659d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:06:46, skipping insertion in model container [2025-02-05 18:06:46,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:06:40" (2/3) ... [2025-02-05 18:06:46,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7d659d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:06:46, skipping insertion in model container [2025-02-05 18:06:46,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:06:45" (3/3) ... [2025-02-05 18:06:46,004 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.anderson.1.prop1-func-interl.c [2025-02-05 18:06:46,021 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 18:06:46,023 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.anderson.1.prop1-func-interl.c that has 1 procedures, 1136 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 18:06:46,118 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 18:06:46,133 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;@65a53394, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 18:06:46,134 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 18:06:46,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 1136 states, 1134 states have (on average 1.5052910052910053) internal successors, (1707), 1135 states have internal predecessors, (1707), 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-02-05 18:06:46,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 18:06:46,154 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:46,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:06:46,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:46,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:46,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1453032494, now seen corresponding path program 1 times [2025-02-05 18:06:46,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:46,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881977894] [2025-02-05 18:06:46,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:46,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:46,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 18:06:46,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 18:06:46,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:46,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:47,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:47,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:47,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881977894] [2025-02-05 18:06:47,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881977894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:47,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:47,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:06:47,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050326313] [2025-02-05 18:06:47,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:47,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:06:47,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:47,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:06:47,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:06:47,060 INFO L87 Difference]: Start difference. First operand has 1136 states, 1134 states have (on average 1.5052910052910053) internal successors, (1707), 1135 states have internal predecessors, (1707), 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 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-02-05 18:06:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:48,023 INFO L93 Difference]: Finished difference Result 2205 states and 3317 transitions. [2025-02-05 18:06:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:06:48,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2025-02-05 18:06:48,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:48,047 INFO L225 Difference]: With dead ends: 2205 [2025-02-05 18:06:48,048 INFO L226 Difference]: Without dead ends: 1135 [2025-02-05 18:06:48,057 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-02-05 18:06:48,061 INFO L435 NwaCegarLoop]: 1423 mSDtfsCounter, 0 mSDsluCounter, 2841 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4264 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:48,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4264 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 18:06:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2025-02-05 18:06:48,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2025-02-05 18:06:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1134 states have (on average 1.5035273368606703) internal successors, (1705), 1134 states have internal predecessors, (1705), 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-02-05 18:06:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1705 transitions. [2025-02-05 18:06:48,181 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1705 transitions. Word has length 59 [2025-02-05 18:06:48,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:48,181 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1705 transitions. [2025-02-05 18:06:48,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-02-05 18:06:48,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1705 transitions. [2025-02-05 18:06:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 18:06:48,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:48,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:06:48,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 18:06:48,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:48,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:48,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2089653424, now seen corresponding path program 1 times [2025-02-05 18:06:48,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:48,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938925860] [2025-02-05 18:06:48,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:48,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:48,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 18:06:48,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 18:06:48,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:48,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:48,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:48,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938925860] [2025-02-05 18:06:48,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938925860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:48,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:48,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:06:48,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113097954] [2025-02-05 18:06:48,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:48,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:06:48,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:48,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:06:48,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:06:48,454 INFO L87 Difference]: Start difference. First operand 1135 states and 1705 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-02-05 18:06:49,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:49,103 INFO L93 Difference]: Finished difference Result 2206 states and 3315 transitions. [2025-02-05 18:06:49,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:06:49,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2025-02-05 18:06:49,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:49,110 INFO L225 Difference]: With dead ends: 2206 [2025-02-05 18:06:49,110 INFO L226 Difference]: Without dead ends: 1137 [2025-02-05 18:06:49,114 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-02-05 18:06:49,115 INFO L435 NwaCegarLoop]: 1423 mSDtfsCounter, 0 mSDsluCounter, 2838 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4261 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:49,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4261 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 18:06:49,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2025-02-05 18:06:49,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1137. [2025-02-05 18:06:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1136 states have (on average 1.5026408450704225) internal successors, (1707), 1136 states have internal predecessors, (1707), 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-02-05 18:06:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1707 transitions. [2025-02-05 18:06:49,149 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1707 transitions. Word has length 60 [2025-02-05 18:06:49,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:49,150 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1707 transitions. [2025-02-05 18:06:49,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-02-05 18:06:49,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1707 transitions. [2025-02-05 18:06:49,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 18:06:49,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:49,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:06:49,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 18:06:49,157 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:49,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:49,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1576764301, now seen corresponding path program 1 times [2025-02-05 18:06:49,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:49,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438707332] [2025-02-05 18:06:49,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:49,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:49,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 18:06:49,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 18:06:49,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:49,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:49,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:49,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438707332] [2025-02-05 18:06:49,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438707332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:49,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:49,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:06:49,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283624153] [2025-02-05 18:06:49,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:49,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:06:49,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:49,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:06:49,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:06:49,416 INFO L87 Difference]: Start difference. First operand 1137 states and 1707 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-02-05 18:06:50,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:50,001 INFO L93 Difference]: Finished difference Result 2210 states and 3319 transitions. [2025-02-05 18:06:50,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:06:50,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2025-02-05 18:06:50,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:50,011 INFO L225 Difference]: With dead ends: 2210 [2025-02-05 18:06:50,012 INFO L226 Difference]: Without dead ends: 1139 [2025-02-05 18:06:50,016 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-02-05 18:06:50,017 INFO L435 NwaCegarLoop]: 1423 mSDtfsCounter, 0 mSDsluCounter, 2833 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4256 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:50,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4256 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:06:50,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2025-02-05 18:06:50,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2025-02-05 18:06:50,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.5017574692442883) internal successors, (1709), 1138 states have internal predecessors, (1709), 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-02-05 18:06:50,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1709 transitions. [2025-02-05 18:06:50,050 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1709 transitions. Word has length 61 [2025-02-05 18:06:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:50,051 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1709 transitions. [2025-02-05 18:06:50,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-02-05 18:06:50,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1709 transitions. [2025-02-05 18:06:50,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 18:06:50,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:50,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:06:50,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 18:06:50,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:50,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:50,056 INFO L85 PathProgramCache]: Analyzing trace with hash -771549931, now seen corresponding path program 1 times [2025-02-05 18:06:50,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:50,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824895752] [2025-02-05 18:06:50,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:50,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:50,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 18:06:50,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 18:06:50,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:50,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:50,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:50,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824895752] [2025-02-05 18:06:50,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824895752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:50,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:50,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:06:50,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004910681] [2025-02-05 18:06:50,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:50,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:06:50,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:50,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:06:50,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:06:50,315 INFO L87 Difference]: Start difference. First operand 1139 states and 1709 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-02-05 18:06:50,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:50,913 INFO L93 Difference]: Finished difference Result 2220 states and 3331 transitions. [2025-02-05 18:06:50,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:06:50,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2025-02-05 18:06:50,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:50,919 INFO L225 Difference]: With dead ends: 2220 [2025-02-05 18:06:50,920 INFO L226 Difference]: Without dead ends: 1147 [2025-02-05 18:06:50,922 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-02-05 18:06:50,924 INFO L435 NwaCegarLoop]: 1423 mSDtfsCounter, 3 mSDsluCounter, 2833 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4256 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:50,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4256 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:06:50,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2025-02-05 18:06:50,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1143. [2025-02-05 18:06:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1142 states have (on average 1.501751313485114) internal successors, (1715), 1142 states have internal predecessors, (1715), 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-02-05 18:06:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1715 transitions. [2025-02-05 18:06:50,960 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1715 transitions. Word has length 62 [2025-02-05 18:06:50,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:50,961 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1715 transitions. [2025-02-05 18:06:50,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-02-05 18:06:50,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1715 transitions. [2025-02-05 18:06:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 18:06:50,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:50,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:06:50,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 18:06:50,963 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:50,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:50,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1743412152, now seen corresponding path program 1 times [2025-02-05 18:06:50,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:50,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24847133] [2025-02-05 18:06:50,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:50,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:51,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 18:06:51,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 18:06:51,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:51,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:51,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:51,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24847133] [2025-02-05 18:06:51,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24847133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:51,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:51,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:51,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817683014] [2025-02-05 18:06:51,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:51,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:51,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:51,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:51,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:51,300 INFO L87 Difference]: Start difference. First operand 1143 states and 1715 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-02-05 18:06:53,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:53,247 INFO L93 Difference]: Finished difference Result 3281 states and 4925 transitions. [2025-02-05 18:06:53,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:53,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 63 [2025-02-05 18:06:53,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:53,259 INFO L225 Difference]: With dead ends: 3281 [2025-02-05 18:06:53,259 INFO L226 Difference]: Without dead ends: 2204 [2025-02-05 18:06:53,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:06:53,264 INFO L435 NwaCegarLoop]: 1140 mSDtfsCounter, 1635 mSDsluCounter, 3345 mSDsCounter, 0 mSdLazyCounter, 2230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 4485 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:53,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1635 Valid, 4485 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2230 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 18:06:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2025-02-05 18:06:53,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 1174. [2025-02-05 18:06:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1173 states have (on average 1.5004262574595055) internal successors, (1760), 1173 states have internal predecessors, (1760), 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-02-05 18:06:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1760 transitions. [2025-02-05 18:06:53,306 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1760 transitions. Word has length 63 [2025-02-05 18:06:53,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:53,306 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1760 transitions. [2025-02-05 18:06:53,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-02-05 18:06:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1760 transitions. [2025-02-05 18:06:53,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 18:06:53,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:53,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:06:53,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 18:06:53,308 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:53,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:53,308 INFO L85 PathProgramCache]: Analyzing trace with hash -806570843, now seen corresponding path program 1 times [2025-02-05 18:06:53,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:53,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961232368] [2025-02-05 18:06:53,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:53,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:53,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 18:06:53,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 18:06:53,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:53,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:53,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:53,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961232368] [2025-02-05 18:06:53,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961232368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:53,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:53,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:53,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161075531] [2025-02-05 18:06:53,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:53,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:53,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:53,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:53,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:53,622 INFO L87 Difference]: Start difference. First operand 1174 states and 1760 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-02-05 18:06:54,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:54,974 INFO L93 Difference]: Finished difference Result 2251 states and 3377 transitions. [2025-02-05 18:06:54,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:06:54,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 64 [2025-02-05 18:06:54,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:54,981 INFO L225 Difference]: With dead ends: 2251 [2025-02-05 18:06:54,981 INFO L226 Difference]: Without dead ends: 1174 [2025-02-05 18:06:54,983 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-02-05 18:06:54,984 INFO L435 NwaCegarLoop]: 1132 mSDtfsCounter, 1648 mSDsluCounter, 2254 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 3386 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:54,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1648 Valid, 3386 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 18:06:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2025-02-05 18:06:55,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1174. [2025-02-05 18:06:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1173 states have (on average 1.4970161977834613) internal successors, (1756), 1173 states have internal predecessors, (1756), 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-02-05 18:06:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1756 transitions. [2025-02-05 18:06:55,014 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1756 transitions. Word has length 64 [2025-02-05 18:06:55,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:55,014 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1756 transitions. [2025-02-05 18:06:55,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-02-05 18:06:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1756 transitions. [2025-02-05 18:06:55,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 18:06:55,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:55,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:06:55,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 18:06:55,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:55,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:55,016 INFO L85 PathProgramCache]: Analyzing trace with hash 96205982, now seen corresponding path program 1 times [2025-02-05 18:06:55,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:55,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985042147] [2025-02-05 18:06:55,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:55,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:55,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 18:06:55,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 18:06:55,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:55,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 18:06:55,090 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 18:06:55,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 18:06:55,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 18:06:55,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:55,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 18:06:55,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 18:06:55,190 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 18:06:55,191 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 18:06:55,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 18:06:55,197 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:06:55,253 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 18:06:55,268 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 18:06:55,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 06:06:55 BoogieIcfgContainer [2025-02-05 18:06:55,272 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 18:06:55,273 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 18:06:55,273 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 18:06:55,273 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 18:06:55,274 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:06:45" (3/4) ... [2025-02-05 18:06:55,276 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 18:06:55,277 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 18:06:55,278 INFO L158 Benchmark]: Toolchain (without parser) took 15480.94ms. Allocated memory was 201.3MB in the beginning and 587.2MB in the end (delta: 385.9MB). Free memory was 154.1MB in the beginning and 322.8MB in the end (delta: -168.7MB). Peak memory consumption was 216.8MB. Max. memory is 16.1GB. [2025-02-05 18:06:55,278 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 18:06:55,278 INFO L158 Benchmark]: CACSL2BoogieTranslator took 666.38ms. Allocated memory is still 201.3MB. Free memory was 153.7MB in the beginning and 110.0MB in the end (delta: 43.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-05 18:06:55,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 554.66ms. Allocated memory was 201.3MB in the beginning and 209.7MB in the end (delta: 8.4MB). Free memory was 110.0MB in the beginning and 122.8MB in the end (delta: -12.8MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. [2025-02-05 18:06:55,279 INFO L158 Benchmark]: Boogie Preprocessor took 570.15ms. Allocated memory is still 209.7MB. Free memory was 122.6MB in the beginning and 94.8MB in the end (delta: 27.8MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2025-02-05 18:06:55,279 INFO L158 Benchmark]: IcfgBuilder took 4395.47ms. Allocated memory was 209.7MB in the beginning and 486.5MB in the end (delta: 276.8MB). Free memory was 94.8MB in the beginning and 234.2MB in the end (delta: -139.5MB). Peak memory consumption was 256.8MB. Max. memory is 16.1GB. [2025-02-05 18:06:55,279 INFO L158 Benchmark]: TraceAbstraction took 9277.56ms. Allocated memory was 486.5MB in the beginning and 587.2MB in the end (delta: 100.7MB). Free memory was 234.2MB in the beginning and 322.8MB in the end (delta: -88.6MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2025-02-05 18:06:55,280 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 587.2MB. Free memory was 322.8MB in the beginning and 322.8MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 18:06:55,281 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.21ms. Allocated memory is still 201.3MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 666.38ms. Allocated memory is still 201.3MB. Free memory was 153.7MB in the beginning and 110.0MB in the end (delta: 43.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 554.66ms. Allocated memory was 201.3MB in the beginning and 209.7MB in the end (delta: 8.4MB). Free memory was 110.0MB in the beginning and 122.8MB in the end (delta: -12.8MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 570.15ms. Allocated memory is still 209.7MB. Free memory was 122.6MB in the beginning and 94.8MB in the end (delta: 27.8MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * IcfgBuilder took 4395.47ms. Allocated memory was 209.7MB in the beginning and 486.5MB in the end (delta: 276.8MB). Free memory was 94.8MB in the beginning and 234.2MB in the end (delta: -139.5MB). Peak memory consumption was 256.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9277.56ms. Allocated memory was 486.5MB in the beginning and 587.2MB in the end (delta: 100.7MB). Free memory was 234.2MB in the beginning and 322.8MB in the end (delta: -88.6MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 587.2MB. Free memory was 322.8MB in the beginning and 322.8MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 147, overapproximation of bitwiseAnd at line 149. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_16 = 0; [L40] const SORT_4 var_39 = 1; [L41] const SORT_4 var_40 = 0; [L42] const SORT_2 var_47 = 1; [L43] const SORT_3 var_49 = 0; [L44] const SORT_4 var_52 = 2; [L45] const SORT_2 var_62 = 0; [L47] SORT_1 input_48; [L48] SORT_1 input_56; [L49] SORT_1 input_63; [L50] SORT_1 input_69; [L51] SORT_1 input_95; [L52] SORT_1 input_99; [L53] SORT_1 input_102; [L54] SORT_1 input_103; [L55] SORT_1 input_109; [L56] SORT_1 input_115; [L57] SORT_1 input_130; [L58] SORT_1 input_148; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L60] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L61] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L62] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L63] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L64] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L65] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L66] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L67] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L68] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L69] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L70] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L71] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L72] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L73] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L74] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L75] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] SORT_2 init_7_arg_1 = var_5; [L78] state_6 = init_7_arg_1 [L79] SORT_2 init_9_arg_1 = var_5; [L80] state_8 = init_9_arg_1 [L81] SORT_2 init_11_arg_1 = var_5; [L82] state_10 = init_11_arg_1 [L83] SORT_2 init_13_arg_1 = var_5; [L84] state_12 = init_13_arg_1 [L85] SORT_2 init_15_arg_1 = var_5; [L86] state_14 = init_15_arg_1 [L87] SORT_1 init_18_arg_1 = var_16; [L88] state_17 = init_18_arg_1 [L89] SORT_1 init_20_arg_1 = var_16; [L90] state_19 = init_20_arg_1 [L91] SORT_1 init_22_arg_1 = var_16; [L92] state_21 = init_22_arg_1 [L93] SORT_1 init_24_arg_1 = var_16; [L94] state_23 = init_24_arg_1 [L95] SORT_1 init_26_arg_1 = var_16; [L96] state_25 = init_26_arg_1 [L97] SORT_1 init_28_arg_1 = var_16; [L98] state_27 = init_28_arg_1 [L99] SORT_1 init_30_arg_1 = var_16; [L100] state_29 = init_30_arg_1 [L101] SORT_1 init_32_arg_1 = var_16; [L102] state_31 = init_32_arg_1 [L103] SORT_1 init_34_arg_1 = var_16; [L104] state_33 = init_34_arg_1 [L105] SORT_1 init_36_arg_1 = var_16; [L106] state_35 = init_36_arg_1 [L107] SORT_1 init_38_arg_1 = var_16; [L108] state_37 = init_38_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L111] input_48 = __VERIFIER_nondet_uchar() [L112] input_56 = __VERIFIER_nondet_uchar() [L113] input_63 = __VERIFIER_nondet_uchar() [L114] input_69 = __VERIFIER_nondet_uchar() [L115] input_95 = __VERIFIER_nondet_uchar() [L116] EXPR input_95 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L116] input_95 = input_95 & mask_SORT_1 [L117] input_99 = __VERIFIER_nondet_uchar() [L118] EXPR input_99 & mask_SORT_1 VAL [input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L118] input_99 = input_99 & mask_SORT_1 [L119] input_102 = __VERIFIER_nondet_uchar() [L120] EXPR input_102 & mask_SORT_1 VAL [input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L120] input_102 = input_102 & mask_SORT_1 [L121] input_103 = __VERIFIER_nondet_uchar() [L122] EXPR input_103 & mask_SORT_1 VAL [input_102=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L122] input_103 = input_103 & mask_SORT_1 [L123] input_109 = __VERIFIER_nondet_uchar() [L124] EXPR input_109 & mask_SORT_1 VAL [input_102=0, input_103=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L124] input_109 = input_109 & mask_SORT_1 [L125] input_115 = __VERIFIER_nondet_uchar() [L126] EXPR input_115 & mask_SORT_1 VAL [input_102=0, input_103=0, input_109=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L126] input_115 = input_115 & mask_SORT_1 [L127] input_130 = __VERIFIER_nondet_uchar() [L128] input_148 = __VERIFIER_nondet_uchar() [L131] SORT_1 var_41_arg_0 = state_25; [L132] SORT_4 var_41_arg_1 = var_39; [L133] SORT_4 var_41_arg_2 = var_40; [L134] SORT_4 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; [L135] SORT_1 var_42_arg_0 = state_35; [L136] SORT_4 var_42_arg_1 = var_39; [L137] SORT_4 var_42_arg_2 = var_40; [L138] SORT_4 var_42 = var_42_arg_0 ? var_42_arg_1 : var_42_arg_2; [L139] SORT_4 var_43_arg_0 = var_41; [L140] SORT_4 var_43_arg_1 = var_42; [L141] SORT_4 var_43 = var_43_arg_0 + var_43_arg_1; VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_43=0, var_47=1, var_49=0, var_52=2, var_62=0] [L142] EXPR var_43 & mask_SORT_4 VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L142] var_43 = var_43 & mask_SORT_4 [L143] SORT_4 var_44_arg_0 = var_43; [L144] SORT_4 var_44_arg_1 = var_39; [L145] SORT_1 var_44 = var_44_arg_0 <= var_44_arg_1; [L146] SORT_1 var_45_arg_0 = ~state_37; VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_44=1, var_45_arg_0=-1, var_47=1, var_49=0, var_52=2, var_62=0] [L147] EXPR var_45_arg_0 & mask_SORT_1 VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_44=1, var_47=1, var_49=0, var_52=2, var_62=0] [L147] var_45_arg_0 = var_45_arg_0 & mask_SORT_1 [L148] SORT_1 var_45_arg_1 = ~var_44; VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_45_arg_0=1, var_45_arg_1=-2, var_47=1, var_49=0, var_52=2, var_62=0] [L149] EXPR var_45_arg_1 & mask_SORT_1 VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_45_arg_0=1, var_47=1, var_49=0, var_52=2, var_62=0] [L149] var_45_arg_1 = var_45_arg_1 & mask_SORT_1 [L150] EXPR var_45_arg_0 & var_45_arg_1 VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L150] SORT_1 var_45 = var_45_arg_0 & var_45_arg_1; [L151] EXPR var_45 & mask_SORT_1 VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L151] var_45 = var_45 & mask_SORT_1 [L152] SORT_1 bad_46_arg_0 = var_45; [L153] CALL __VERIFIER_assert(!(bad_46_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3286 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3286 mSDsluCounter, 24908 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16944 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7333 IncrementalHoareTripleChecker+Invalid, 7335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 7964 mSDtfsCounter, 7333 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1174occurred in iteration=5, InterpolantAutomatonStates: 26, 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, 6 MinimizatonAttempts, 1034 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 434 NumberOfCodeBlocks, 434 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 363 ConstructedInterpolants, 0 QuantifiedInterpolants, 830 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 18:06:55,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 5335ff3ae60d503c7989a0baf091bf4ee05fe6735e77308a3563d234056465f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 18:06:58,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 18:06:58,157 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-05 18:06:58,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 18:06:58,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 18:06:58,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 18:06:58,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 18:06:58,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 18:06:58,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 18:06:58,197 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 18:06:58,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 18:06:58,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 18:06:58,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 18:06:58,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 18:06:58,198 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 18:06:58,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 18:06:58,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 18:06:58,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 18:06:58,198 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 18:06:58,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 18:06:58,198 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 18:06:58,198 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 18:06:58,198 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 18:06:58,198 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 18:06:58,199 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 18:06:58,199 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 18:06:58,199 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 18:06:58,199 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 18:06:58,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 18:06:58,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 18:06:58,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 18:06:58,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:06:58,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 18:06:58,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 18:06:58,199 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 18:06:58,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 18:06:58,199 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 18:06:58,200 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 18:06:58,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 18:06:58,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 18:06:58,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 18:06:58,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 18:06:58,200 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-jdk21/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 -> 5335ff3ae60d503c7989a0baf091bf4ee05fe6735e77308a3563d234056465f1 [2025-02-05 18:06:58,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 18:06:58,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 18:06:58,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 18:06:58,565 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 18:06:58,566 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 18:06:58,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c [2025-02-05 18:06:59,947 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9788f4716/a9c5f1a06b2b4952938fc6d49eddb85a/FLAGe438ebe68 [2025-02-05 18:07:00,292 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 18:07:00,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c [2025-02-05 18:07:00,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9788f4716/a9c5f1a06b2b4952938fc6d49eddb85a/FLAGe438ebe68 [2025-02-05 18:07:00,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9788f4716/a9c5f1a06b2b4952938fc6d49eddb85a [2025-02-05 18:07:00,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 18:07:00,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 18:07:00,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 18:07:00,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 18:07:00,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 18:07:00,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:07:00" (1/1) ... [2025-02-05 18:07:00,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a0cc833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:00, skipping insertion in model container [2025-02-05 18:07:00,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:07:00" (1/1) ... [2025-02-05 18:07:00,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 18:07:00,594 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c[1175,1188] [2025-02-05 18:07:00,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:07:00,841 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 18:07:00,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c[1175,1188] [2025-02-05 18:07:01,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:07:01,027 INFO L204 MainTranslator]: Completed translation [2025-02-05 18:07:01,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:01 WrapperNode [2025-02-05 18:07:01,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 18:07:01,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 18:07:01,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 18:07:01,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 18:07:01,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:01" (1/1) ... [2025-02-05 18:07:01,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:01" (1/1) ... [2025-02-05 18:07:01,160 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 920 [2025-02-05 18:07:01,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 18:07:01,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 18:07:01,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 18:07:01,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 18:07:01,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:01" (1/1) ... [2025-02-05 18:07:01,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:01" (1/1) ... [2025-02-05 18:07:01,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:01" (1/1) ... [2025-02-05 18:07:01,228 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-02-05 18:07:01,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:01" (1/1) ... [2025-02-05 18:07:01,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:01" (1/1) ... [2025-02-05 18:07:01,272 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:01" (1/1) ... [2025-02-05 18:07:01,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:01" (1/1) ... [2025-02-05 18:07:01,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:01" (1/1) ... [2025-02-05 18:07:01,292 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:01" (1/1) ... [2025-02-05 18:07:01,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 18:07:01,305 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 18:07:01,305 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 18:07:01,305 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 18:07:01,306 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:01" (1/1) ... [2025-02-05 18:07:01,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:07:01,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:07:01,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 18:07:01,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 18:07:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 18:07:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 18:07:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 18:07:01,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 18:07:01,647 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 18:07:01,649 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 18:07:03,814 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2025-02-05 18:07:03,814 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 18:07:03,825 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 18:07:03,825 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 18:07:03,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:07:03 BoogieIcfgContainer [2025-02-05 18:07:03,826 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 18:07:03,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 18:07:03,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 18:07:03,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 18:07:03,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 06:07:00" (1/3) ... [2025-02-05 18:07:03,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e219bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:07:03, skipping insertion in model container [2025-02-05 18:07:03,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:01" (2/3) ... [2025-02-05 18:07:03,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e219bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:07:03, skipping insertion in model container [2025-02-05 18:07:03,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:07:03" (3/3) ... [2025-02-05 18:07:03,838 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.anderson.1.prop1-func-interl.c [2025-02-05 18:07:03,855 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 18:07:03,857 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.anderson.1.prop1-func-interl.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 18:07:03,910 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 18:07:03,923 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;@5ebd2c5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 18:07:03,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 18:07:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:07:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-05 18:07:03,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:07:03,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-05 18:07:03,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:07:03,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:07:03,943 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-02-05 18:07:03,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 18:07:03,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107786299] [2025-02-05 18:07:03,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:07:03,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:07:03,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:07:03,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 18:07:03,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 18:07:04,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-05 18:07:04,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-05 18:07:04,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:07:04,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:07:04,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-05 18:07:04,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:07:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:07:04,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 18:07:04,658 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 18:07:04,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107786299] [2025-02-05 18:07:04,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107786299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:07:04,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:07:04,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:07:04,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105938773] [2025-02-05 18:07:04,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:07:04,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:07:04,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 18:07:04,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:07:04,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:07:04,690 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:07:05,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:07:05,216 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-02-05 18:07:05,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:07:05,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-05 18:07:05,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:07:05,224 INFO L225 Difference]: With dead ends: 18 [2025-02-05 18:07:05,224 INFO L226 Difference]: Without dead ends: 10 [2025-02-05 18:07:05,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:07:05,230 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:07:05,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:07:05,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-05 18:07:05,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-02-05 18:07:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:07:05,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-05 18:07:05,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-02-05 18:07:05,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:07:05,262 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-05 18:07:05,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:07:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-05 18:07:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 18:07:05,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:07:05,263 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-05 18:07:05,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 18:07:05,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:07:05,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:07:05,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:07:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-02-05 18:07:05,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 18:07:05,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1104944799] [2025-02-05 18:07:05,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:07:05,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:07:05,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:07:05,469 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 18:07:05,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 18:07:05,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 18:07:05,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 18:07:05,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:07:05,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:07:05,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-05 18:07:06,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:07:32,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:07:32,578 INFO L312 TraceCheckSpWp]: Computing backward predicates...