./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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.vis_arrays_vsaR_p15.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 52bb3902ccaac92ca995ec60bcedc54784c82a6cab90a6a11e201a4e0de664cb --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:16:14,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:16:14,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:16:14,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:16:14,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:16:14,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:16:14,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:16:14,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:16:14,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:16:14,236 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:16:14,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:16:14,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:16:14,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:16:14,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:16:14,238 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:16:14,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:16:14,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:16:14,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:16:14,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:16:14,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:16:14,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:16:14,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:16:14,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:16:14,238 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:16:14,239 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:16:14,239 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:16:14,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:16:14,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:16:14,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:16:14,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:16:14,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:16:14,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:16:14,240 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:16:14,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:16:14,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:16:14,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:16:14,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:16:14,240 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:16:14,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:16:14,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:16:14,240 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 -> 52bb3902ccaac92ca995ec60bcedc54784c82a6cab90a6a11e201a4e0de664cb [2025-02-08 00:16:14,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:16:14,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:16:14,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:16:14,550 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:16:14,550 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:16:14,552 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.vis_arrays_vsaR_p15.c [2025-02-08 00:16:15,933 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9aa3ac7bc/e26a6f2930f84021a9e2a4c7b0f96e5c/FLAGc7e85217b [2025-02-08 00:16:16,328 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:16:16,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c [2025-02-08 00:16:16,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9aa3ac7bc/e26a6f2930f84021a9e2a4c7b0f96e5c/FLAGc7e85217b [2025-02-08 00:16:16,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9aa3ac7bc/e26a6f2930f84021a9e2a4c7b0f96e5c [2025-02-08 00:16:16,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:16:16,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:16:16,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:16:16,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:16:16,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:16:16,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:16:16" (1/1) ... [2025-02-08 00:16:16,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6a1aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:16, skipping insertion in model container [2025-02-08 00:16:16,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:16:16" (1/1) ... [2025-02-08 00:16:16,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:16:16,610 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.vis_arrays_vsaR_p15.c[1259,1272] [2025-02-08 00:16:16,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:16:16,908 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:16:16,920 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.vis_arrays_vsaR_p15.c[1259,1272] [2025-02-08 00:16:17,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:16:17,077 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:16:17,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:17 WrapperNode [2025-02-08 00:16:17,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:16:17,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:16:17,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:16:17,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:16:17,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:17" (1/1) ... [2025-02-08 00:16:17,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:17" (1/1) ... [2025-02-08 00:16:17,351 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2148 [2025-02-08 00:16:17,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:16:17,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:16:17,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:16:17,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:16:17,360 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:17" (1/1) ... [2025-02-08 00:16:17,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:17" (1/1) ... [2025-02-08 00:16:17,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:17" (1/1) ... [2025-02-08 00:16:17,502 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-08 00:16:17,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:17" (1/1) ... [2025-02-08 00:16:17,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:17" (1/1) ... [2025-02-08 00:16:17,548 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:17" (1/1) ... [2025-02-08 00:16:17,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:17" (1/1) ... [2025-02-08 00:16:17,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:17" (1/1) ... [2025-02-08 00:16:17,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:17" (1/1) ... [2025-02-08 00:16:17,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:16:17,639 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:16:17,639 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:16:17,639 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:16:17,640 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:17" (1/1) ... [2025-02-08 00:16:17,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:16:17,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:16:17,679 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-08 00:16:17,685 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-08 00:16:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:16:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:16:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:16:17,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:16:17,988 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:16:17,990 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:16:20,261 INFO L? ?]: Removed 1342 outVars from TransFormulas that were not future-live. [2025-02-08 00:16:20,262 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:16:20,373 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:16:20,373 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:16:20,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:16:20 BoogieIcfgContainer [2025-02-08 00:16:20,374 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:16:20,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:16:20,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:16:20,380 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:16:20,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:16:16" (1/3) ... [2025-02-08 00:16:20,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd51478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:16:20, skipping insertion in model container [2025-02-08 00:16:20,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:17" (2/3) ... [2025-02-08 00:16:20,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd51478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:16:20, skipping insertion in model container [2025-02-08 00:16:20,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:16:20" (3/3) ... [2025-02-08 00:16:20,382 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p15.c [2025-02-08 00:16:20,396 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:16:20,398 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p15.c that has 1 procedures, 541 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:16:20,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:16:20,471 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;@6df1e14b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:16:20,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:16:20,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 541 states, 539 states have (on average 1.5009276437847867) internal successors, (809), 540 states have internal predecessors, (809), 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-08 00:16:20,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 00:16:20,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:20,483 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] [2025-02-08 00:16:20,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:20,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:20,490 INFO L85 PathProgramCache]: Analyzing trace with hash -394631414, now seen corresponding path program 1 times [2025-02-08 00:16:20,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:20,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889330473] [2025-02-08 00:16:20,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:20,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:20,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 00:16:20,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 00:16:20,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:20,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:21,313 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-08 00:16:21,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:21,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889330473] [2025-02-08 00:16:21,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889330473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:21,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:21,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:16:21,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877397309] [2025-02-08 00:16:21,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:21,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:16:21,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:21,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:16:21,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:16:21,340 INFO L87 Difference]: Start difference. First operand has 541 states, 539 states have (on average 1.5009276437847867) internal successors, (809), 540 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-08 00:16:21,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:21,767 INFO L93 Difference]: Finished difference Result 1029 states and 1541 transitions. [2025-02-08 00:16:21,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:16:21,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2025-02-08 00:16:21,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:21,782 INFO L225 Difference]: With dead ends: 1029 [2025-02-08 00:16:21,782 INFO L226 Difference]: Without dead ends: 541 [2025-02-08 00:16:21,788 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-08 00:16:21,791 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 0 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:21,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2008 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:16:21,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-02-08 00:16:21,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-02-08 00:16:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 540 states have (on average 1.4962962962962962) internal successors, (808), 540 states have internal predecessors, (808), 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-08 00:16:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 808 transitions. [2025-02-08 00:16:21,857 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 808 transitions. Word has length 44 [2025-02-08 00:16:21,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:21,858 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 808 transitions. [2025-02-08 00:16:21,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-08 00:16:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 808 transitions. [2025-02-08 00:16:21,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 00:16:21,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:21,861 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] [2025-02-08 00:16:21,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:16:21,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:21,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:21,865 INFO L85 PathProgramCache]: Analyzing trace with hash 656007990, now seen corresponding path program 1 times [2025-02-08 00:16:21,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:21,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730886492] [2025-02-08 00:16:21,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:21,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:21,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 00:16:21,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 00:16:21,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:21,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:22,111 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-08 00:16:22,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:22,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730886492] [2025-02-08 00:16:22,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730886492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:22,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:22,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:16:22,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976875530] [2025-02-08 00:16:22,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:22,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:16:22,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:22,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:16:22,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:16:22,116 INFO L87 Difference]: Start difference. First operand 541 states and 808 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:22,426 INFO L93 Difference]: Finished difference Result 1031 states and 1540 transitions. [2025-02-08 00:16:22,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:16:22,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-02-08 00:16:22,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:22,431 INFO L225 Difference]: With dead ends: 1031 [2025-02-08 00:16:22,431 INFO L226 Difference]: Without dead ends: 543 [2025-02-08 00:16:22,433 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-08 00:16:22,436 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 0 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:22,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2005 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:16:22,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-02-08 00:16:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2025-02-08 00:16:22,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 1.4944649446494465) internal successors, (810), 542 states have internal predecessors, (810), 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-08 00:16:22,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 810 transitions. [2025-02-08 00:16:22,463 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 810 transitions. Word has length 45 [2025-02-08 00:16:22,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:22,463 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 810 transitions. [2025-02-08 00:16:22,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:22,463 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 810 transitions. [2025-02-08 00:16:22,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 00:16:22,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:22,464 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:22,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:16:22,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:22,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:22,465 INFO L85 PathProgramCache]: Analyzing trace with hash 792921221, now seen corresponding path program 1 times [2025-02-08 00:16:22,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:22,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093575597] [2025-02-08 00:16:22,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:22,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:22,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 00:16:22,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 00:16:22,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:22,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:22,892 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-08 00:16:22,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:22,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093575597] [2025-02-08 00:16:22,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093575597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:22,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:22,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:16:22,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648755137] [2025-02-08 00:16:22,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:22,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:16:22,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:22,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:16:22,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:16:22,895 INFO L87 Difference]: Start difference. First operand 543 states and 810 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:23,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:23,233 INFO L93 Difference]: Finished difference Result 1037 states and 1547 transitions. [2025-02-08 00:16:23,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:16:23,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-08 00:16:23,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:23,236 INFO L225 Difference]: With dead ends: 1037 [2025-02-08 00:16:23,236 INFO L226 Difference]: Without dead ends: 547 [2025-02-08 00:16:23,237 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-08 00:16:23,238 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 2 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:23,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2001 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:16:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-08 00:16:23,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2025-02-08 00:16:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.4926470588235294) internal successors, (812), 544 states have internal predecessors, (812), 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-08 00:16:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 812 transitions. [2025-02-08 00:16:23,249 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 812 transitions. Word has length 46 [2025-02-08 00:16:23,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:23,249 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 812 transitions. [2025-02-08 00:16:23,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:23,250 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 812 transitions. [2025-02-08 00:16:23,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 00:16:23,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:23,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:23,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:16:23,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:23,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:23,251 INFO L85 PathProgramCache]: Analyzing trace with hash 699117371, now seen corresponding path program 1 times [2025-02-08 00:16:23,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:23,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25826564] [2025-02-08 00:16:23,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:23,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:23,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 00:16:23,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 00:16:23,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:23,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:23,551 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-08 00:16:23,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:23,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25826564] [2025-02-08 00:16:23,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25826564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:23,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:23,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:16:23,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11131927] [2025-02-08 00:16:23,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:23,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:16:23,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:23,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:16:23,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:16:23,554 INFO L87 Difference]: Start difference. First operand 545 states and 812 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:23,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:23,982 INFO L93 Difference]: Finished difference Result 1041 states and 1551 transitions. [2025-02-08 00:16:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:16:23,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-02-08 00:16:23,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:23,986 INFO L225 Difference]: With dead ends: 1041 [2025-02-08 00:16:23,986 INFO L226 Difference]: Without dead ends: 549 [2025-02-08 00:16:23,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:16:23,988 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 1 mSDsluCounter, 2659 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3327 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:23,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3327 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:16:23,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-02-08 00:16:23,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 548. [2025-02-08 00:16:24,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.4917733089579526) internal successors, (816), 547 states have internal predecessors, (816), 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-08 00:16:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 816 transitions. [2025-02-08 00:16:24,003 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 816 transitions. Word has length 47 [2025-02-08 00:16:24,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:24,003 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 816 transitions. [2025-02-08 00:16:24,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 816 transitions. [2025-02-08 00:16:24,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 00:16:24,004 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:24,004 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:24,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:16:24,004 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:24,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:24,005 INFO L85 PathProgramCache]: Analyzing trace with hash -2110170080, now seen corresponding path program 1 times [2025-02-08 00:16:24,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:24,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007701645] [2025-02-08 00:16:24,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:24,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:24,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 00:16:24,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 00:16:24,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:24,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:24,189 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-08 00:16:24,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:24,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007701645] [2025-02-08 00:16:24,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007701645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:24,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:24,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:16:24,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895384694] [2025-02-08 00:16:24,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:24,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:16:24,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:24,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:16:24,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:16:24,193 INFO L87 Difference]: Start difference. First operand 548 states and 816 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:24,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:24,519 INFO L93 Difference]: Finished difference Result 1049 states and 1562 transitions. [2025-02-08 00:16:24,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:16:24,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-02-08 00:16:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:24,523 INFO L225 Difference]: With dead ends: 1049 [2025-02-08 00:16:24,525 INFO L226 Difference]: Without dead ends: 554 [2025-02-08 00:16:24,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:16:24,526 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 4 mSDsluCounter, 2000 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:24,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2670 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:16:24,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-08 00:16:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-02-08 00:16:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 1.4900542495479205) internal successors, (824), 553 states have internal predecessors, (824), 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-08 00:16:24,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 824 transitions. [2025-02-08 00:16:24,555 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 824 transitions. Word has length 47 [2025-02-08 00:16:24,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:24,556 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 824 transitions. [2025-02-08 00:16:24,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 824 transitions. [2025-02-08 00:16:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 00:16:24,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:24,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:24,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:16:24,561 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:24,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:24,561 INFO L85 PathProgramCache]: Analyzing trace with hash 597251526, now seen corresponding path program 1 times [2025-02-08 00:16:24,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:24,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702122640] [2025-02-08 00:16:24,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:24,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:24,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 00:16:24,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 00:16:24,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:24,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:25,053 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-08 00:16:25,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:25,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702122640] [2025-02-08 00:16:25,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702122640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:25,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:25,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:16:25,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69902210] [2025-02-08 00:16:25,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:25,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:16:25,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:25,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:16:25,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:16:25,059 INFO L87 Difference]: Start difference. First operand 554 states and 824 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:25,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:25,578 INFO L93 Difference]: Finished difference Result 1060 states and 1576 transitions. [2025-02-08 00:16:25,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:16:25,579 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-02-08 00:16:25,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:25,582 INFO L225 Difference]: With dead ends: 1060 [2025-02-08 00:16:25,582 INFO L226 Difference]: Without dead ends: 559 [2025-02-08 00:16:25,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:16:25,586 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 779 mSDsluCounter, 2641 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 3304 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:25,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 3304 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:16:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-02-08 00:16:25,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 558. [2025-02-08 00:16:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 1.488330341113106) internal successors, (829), 557 states have internal predecessors, (829), 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-08 00:16:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 829 transitions. [2025-02-08 00:16:25,600 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 829 transitions. Word has length 48 [2025-02-08 00:16:25,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:25,601 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 829 transitions. [2025-02-08 00:16:25,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:25,601 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 829 transitions. [2025-02-08 00:16:25,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 00:16:25,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:25,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:25,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:16:25,605 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:25,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:25,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1663271141, now seen corresponding path program 1 times [2025-02-08 00:16:25,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:25,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341718490] [2025-02-08 00:16:25,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:25,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:25,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 00:16:25,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 00:16:25,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:25,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:25,873 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-08 00:16:25,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:25,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341718490] [2025-02-08 00:16:25,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341718490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:25,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:25,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:16:25,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355959964] [2025-02-08 00:16:25,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:25,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:16:25,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:25,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:16:25,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:16:25,875 INFO L87 Difference]: Start difference. First operand 558 states and 829 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:26,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:26,198 INFO L93 Difference]: Finished difference Result 1065 states and 1582 transitions. [2025-02-08 00:16:26,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:16:26,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-02-08 00:16:26,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:26,201 INFO L225 Difference]: With dead ends: 1065 [2025-02-08 00:16:26,201 INFO L226 Difference]: Without dead ends: 560 [2025-02-08 00:16:26,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:16:26,202 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 779 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:26,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1996 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:16:26,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-02-08 00:16:26,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-02-08 00:16:26,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.486583184257603) internal successors, (831), 559 states have internal predecessors, (831), 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-08 00:16:26,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 831 transitions. [2025-02-08 00:16:26,216 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 831 transitions. Word has length 48 [2025-02-08 00:16:26,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:26,216 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 831 transitions. [2025-02-08 00:16:26,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:26,217 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 831 transitions. [2025-02-08 00:16:26,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 00:16:26,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:26,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:26,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:16:26,218 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:26,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:26,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1647744881, now seen corresponding path program 1 times [2025-02-08 00:16:26,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:26,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257380918] [2025-02-08 00:16:26,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:26,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:26,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 00:16:26,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 00:16:26,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:26,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:16:26,300 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:16:26,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 00:16:26,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 00:16:26,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:26,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:16:26,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:16:26,419 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:16:26,420 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:16:26,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:16:26,424 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:26,472 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:16:26,490 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:16:26,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:16:26 BoogieIcfgContainer [2025-02-08 00:16:26,494 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:16:26,495 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:16:26,495 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:16:26,495 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:16:26,496 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:16:20" (3/4) ... [2025-02-08 00:16:26,498 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:16:26,498 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:16:26,500 INFO L158 Benchmark]: Toolchain (without parser) took 10119.83ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 131.2MB in the beginning and 320.3MB in the end (delta: -189.1MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2025-02-08 00:16:26,500 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:16:26,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 697.69ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 87.6MB in the end (delta: 43.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 00:16:26,500 INFO L158 Benchmark]: Boogie Procedure Inliner took 272.85ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 87.6MB in the beginning and 110.9MB in the end (delta: -23.3MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. [2025-02-08 00:16:26,501 INFO L158 Benchmark]: Boogie Preprocessor took 285.28ms. Allocated memory is still 176.2MB. Free memory was 110.9MB in the beginning and 89.2MB in the end (delta: 21.7MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2025-02-08 00:16:26,501 INFO L158 Benchmark]: IcfgBuilder took 2734.75ms. Allocated memory was 176.2MB in the beginning and 352.3MB in the end (delta: 176.2MB). Free memory was 89.2MB in the beginning and 121.3MB in the end (delta: -32.0MB). Peak memory consumption was 156.8MB. Max. memory is 16.1GB. [2025-02-08 00:16:26,501 INFO L158 Benchmark]: TraceAbstraction took 6118.49ms. Allocated memory was 352.3MB in the beginning and 427.8MB in the end (delta: 75.5MB). Free memory was 120.2MB in the beginning and 320.3MB in the end (delta: -200.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:16:26,501 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 427.8MB. Free memory was 320.3MB in the beginning and 320.3MB in the end (delta: 44.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:16:26,503 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.40ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 697.69ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 87.6MB in the end (delta: 43.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 272.85ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 87.6MB in the beginning and 110.9MB in the end (delta: -23.3MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 285.28ms. Allocated memory is still 176.2MB. Free memory was 110.9MB in the beginning and 89.2MB in the end (delta: 21.7MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * IcfgBuilder took 2734.75ms. Allocated memory was 176.2MB in the beginning and 352.3MB in the end (delta: 176.2MB). Free memory was 89.2MB in the beginning and 121.3MB in the end (delta: -32.0MB). Peak memory consumption was 156.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6118.49ms. Allocated memory was 352.3MB in the beginning and 427.8MB in the end (delta: 75.5MB). Free memory was 120.2MB in the beginning and 320.3MB in the end (delta: -200.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 427.8MB. Free memory was 320.3MB in the beginning and 320.3MB in the end (delta: 44.9kB). 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 bitwiseOr at line 175, overapproximation of bitwiseAnd at line 180. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 3); [L36] const SORT_7 msb_SORT_7 = (SORT_7)1 << (3 - 1); [L38] const SORT_20 mask_SORT_20 = (SORT_20)-1 >> (sizeof(SORT_20) * 8 - 2); [L39] const SORT_20 msb_SORT_20 = (SORT_20)1 << (2 - 1); [L41] const SORT_85 mask_SORT_85 = (SORT_85)-1 >> (sizeof(SORT_85) * 8 - 4); [L42] const SORT_85 msb_SORT_85 = (SORT_85)1 << (4 - 1); [L44] const SORT_150 mask_SORT_150 = (SORT_150)-1 >> (sizeof(SORT_150) * 8 - 32); [L45] const SORT_150 msb_SORT_150 = (SORT_150)1 << (32 - 1); [L47] const SORT_7 var_8 = 0; [L48] const SORT_7 var_11 = 4; [L49] const SORT_5 var_13 = 0; [L50] const SORT_7 var_17 = 2; [L51] const SORT_20 var_22 = 0; [L52] const SORT_3 var_26 = 0; [L53] const SORT_1 var_35 = 1; [L54] const SORT_1 var_43 = 0; [L55] const SORT_7 var_60 = 1; [L56] const SORT_7 var_66 = 5; [L57] const SORT_7 var_70 = 3; [L58] const SORT_7 var_102 = 7; [L59] const SORT_7 var_107 = 6; [L60] const SORT_150 var_152 = 0; [L61] const SORT_3 var_167 = 2; [L62] const SORT_3 var_184 = 31; [L64] SORT_1 input_2; [L65] SORT_3 input_4; [L66] SORT_5 input_6; [L67] SORT_3 input_173; [L68] SORT_3 input_174; [L69] SORT_3 input_175; [L70] SORT_3 input_183; [L71] SORT_3 input_193; [L72] SORT_3 input_194; [L73] SORT_3 input_195; [L74] SORT_3 input_198; [L75] SORT_3 input_217; [L76] SORT_3 input_218; [L77] SORT_3 input_219; [L78] SORT_3 input_222; [L79] SORT_3 input_224; [L80] SORT_20 input_238; [L81] SORT_20 input_239; [L82] SORT_20 input_240; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L84] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L85] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L85] SORT_5 state_14 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L86] SORT_3 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L87] SORT_3 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L88] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L89] SORT_3 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L90] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L91] SORT_3 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L92] SORT_3 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L93] SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L94] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L95] SORT_3 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L96] SORT_3 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L98] SORT_7 init_10_arg_1 = var_8; [L99] state_9 = init_10_arg_1 [L100] SORT_5 init_15_arg_1 = var_13; [L101] state_14 = init_15_arg_1 [L102] SORT_3 init_28_arg_1 = var_26; [L103] state_27 = init_28_arg_1 [L104] SORT_3 init_30_arg_1 = var_26; [L105] state_29 = init_30_arg_1 [L106] SORT_3 init_40_arg_1 = var_26; [L107] state_39 = init_40_arg_1 [L108] SORT_3 init_42_arg_1 = var_26; [L109] state_41 = init_42_arg_1 [L110] SORT_1 init_45_arg_1 = var_43; [L111] state_44 = init_45_arg_1 [L112] SORT_3 init_47_arg_1 = var_26; [L113] state_46 = init_47_arg_1 [L114] SORT_3 init_49_arg_1 = var_26; [L115] state_48 = init_49_arg_1 [L116] SORT_3 init_51_arg_1 = var_26; [L117] state_50 = init_51_arg_1 [L118] SORT_3 init_53_arg_1 = var_26; [L119] state_52 = init_53_arg_1 [L120] SORT_3 init_55_arg_1 = var_26; [L121] state_54 = init_55_arg_1 [L122] SORT_3 init_57_arg_1 = var_26; [L123] state_56 = init_57_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L126] input_2 = __VERIFIER_nondet_uchar() [L127] input_4 = __VERIFIER_nondet_uchar() [L128] input_6 = __VERIFIER_nondet_ushort() [L129] input_173 = __VERIFIER_nondet_uchar() [L130] input_174 = __VERIFIER_nondet_uchar() [L131] input_175 = __VERIFIER_nondet_uchar() [L132] input_183 = __VERIFIER_nondet_uchar() [L133] input_193 = __VERIFIER_nondet_uchar() [L134] input_194 = __VERIFIER_nondet_uchar() [L135] input_195 = __VERIFIER_nondet_uchar() [L136] input_198 = __VERIFIER_nondet_uchar() [L137] input_217 = __VERIFIER_nondet_uchar() [L138] input_218 = __VERIFIER_nondet_uchar() [L139] input_219 = __VERIFIER_nondet_uchar() [L140] input_222 = __VERIFIER_nondet_uchar() [L141] input_224 = __VERIFIER_nondet_uchar() [L142] input_238 = __VERIFIER_nondet_uchar() [L143] input_239 = __VERIFIER_nondet_uchar() [L144] input_240 = __VERIFIER_nondet_uchar() [L147] SORT_7 var_12_arg_0 = state_9; [L148] SORT_7 var_12_arg_1 = var_11; [L149] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L150] SORT_5 var_16_arg_0 = state_14; [L151] SORT_7 var_16 = var_16_arg_0 >> 9; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_12=0, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L152] EXPR var_16 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_12=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L152] var_16 = var_16 & mask_SORT_7 [L153] SORT_7 var_18_arg_0 = var_16; [L154] SORT_7 var_18_arg_1 = var_17; [L155] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L156] SORT_1 var_19_arg_0 = var_12; [L157] SORT_1 var_19_arg_1 = var_18; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_19_arg_0=0, var_19_arg_1=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L158] EXPR var_19_arg_0 & var_19_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L158] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L159] SORT_5 var_21_arg_0 = state_14; [L160] SORT_20 var_21 = var_21_arg_0 >> 7; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_19=0, var_21=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L161] EXPR var_21 & mask_SORT_20 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_19=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L161] var_21 = var_21 & mask_SORT_20 [L162] SORT_20 var_23_arg_0 = var_21; [L163] SORT_20 var_23_arg_1 = var_22; [L164] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L165] SORT_1 var_24_arg_0 = var_19; [L166] SORT_1 var_24_arg_1 = var_23; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_24_arg_0=0, var_24_arg_1=1, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L167] EXPR var_24_arg_0 & var_24_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L167] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L168] SORT_1 var_25_arg_0 = var_24; [L169] SORT_1 var_25 = ~var_25_arg_0; [L170] SORT_3 var_31_arg_0 = state_27; [L171] SORT_3 var_31_arg_1 = state_29; [L172] SORT_1 var_31 = var_31_arg_0 == var_31_arg_1; [L173] SORT_1 var_32_arg_0 = var_25; [L174] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_32_arg_0=-1, var_32_arg_1=1, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L175] EXPR var_32_arg_0 | var_32_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L175] SORT_1 var_32 = var_32_arg_0 | var_32_arg_1; [L176] SORT_1 var_36_arg_0 = var_32; [L177] SORT_1 var_36 = ~var_36_arg_0; [L178] SORT_1 var_37_arg_0 = var_35; [L179] SORT_1 var_37_arg_1 = var_36; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_37_arg_0=1, var_37_arg_1=-1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L180] EXPR var_37_arg_0 & var_37_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L180] SORT_1 var_37 = var_37_arg_0 & var_37_arg_1; [L181] EXPR var_37 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L181] var_37 = var_37 & mask_SORT_1 [L182] SORT_1 bad_38_arg_0 = var_37; [L183] CALL __VERIFIER_assert(!(bad_38_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 541 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1565 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1565 mSDsluCounter, 17311 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12631 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3639 IncrementalHoareTripleChecker+Invalid, 3640 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 4680 mSDtfsCounter, 3639 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=560occurred in iteration=7, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 607 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-08 00:16:26,531 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.vis_arrays_vsaR_p15.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 52bb3902ccaac92ca995ec60bcedc54784c82a6cab90a6a11e201a4e0de664cb --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:16:28,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:16:29,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-08 00:16:29,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:16:29,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:16:29,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:16:29,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:16:29,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:16:29,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:16:29,069 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:16:29,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:16:29,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:16:29,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:16:29,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:16:29,070 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:16:29,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:16:29,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:16:29,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:16:29,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:16:29,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:16:29,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:16:29,071 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:16:29,071 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:16:29,071 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:16:29,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:16:29,071 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:16:29,072 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:16:29,072 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:16:29,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:16:29,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:16:29,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:16:29,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:16:29,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:16:29,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:16:29,073 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:16:29,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:16:29,073 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:16:29,073 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:16:29,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:16:29,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:16:29,074 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:16:29,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:16:29,074 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 -> 52bb3902ccaac92ca995ec60bcedc54784c82a6cab90a6a11e201a4e0de664cb [2025-02-08 00:16:29,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:16:29,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:16:29,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:16:29,383 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:16:29,385 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:16:29,387 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.vis_arrays_vsaR_p15.c [2025-02-08 00:16:30,742 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7dee1d74/79015483a2f84badb7b4f10be4291b44/FLAGec1e2d1a5 [2025-02-08 00:16:31,057 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:16:31,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c [2025-02-08 00:16:31,086 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7dee1d74/79015483a2f84badb7b4f10be4291b44/FLAGec1e2d1a5 [2025-02-08 00:16:31,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7dee1d74/79015483a2f84badb7b4f10be4291b44 [2025-02-08 00:16:31,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:16:31,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:16:31,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:16:31,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:16:31,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:16:31,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:16:31" (1/1) ... [2025-02-08 00:16:31,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@654bf6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:31, skipping insertion in model container [2025-02-08 00:16:31,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:16:31" (1/1) ... [2025-02-08 00:16:31,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:16:31,514 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.vis_arrays_vsaR_p15.c[1259,1272] [2025-02-08 00:16:31,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:16:31,724 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:16:31,731 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.vis_arrays_vsaR_p15.c[1259,1272] [2025-02-08 00:16:31,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:16:31,839 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:16:31,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:31 WrapperNode [2025-02-08 00:16:31,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:16:31,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:16:31,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:16:31,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:16:31,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:31" (1/1) ... [2025-02-08 00:16:31,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:31" (1/1) ... [2025-02-08 00:16:31,942 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1082 [2025-02-08 00:16:31,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:16:31,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:16:31,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:16:31,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:16:31,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:31" (1/1) ... [2025-02-08 00:16:31,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:31" (1/1) ... [2025-02-08 00:16:31,964 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:31" (1/1) ... [2025-02-08 00:16:32,013 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-08 00:16:32,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:31" (1/1) ... [2025-02-08 00:16:32,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:31" (1/1) ... [2025-02-08 00:16:32,043 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:31" (1/1) ... [2025-02-08 00:16:32,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:31" (1/1) ... [2025-02-08 00:16:32,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:31" (1/1) ... [2025-02-08 00:16:32,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:31" (1/1) ... [2025-02-08 00:16:32,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:16:32,098 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:16:32,099 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:16:32,099 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:16:32,100 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:31" (1/1) ... [2025-02-08 00:16:32,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:16:32,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:16:32,129 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-08 00:16:32,132 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-08 00:16:32,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:16:32,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 00:16:32,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:16:32,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:16:32,406 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:16:32,408 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:16:33,660 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-02-08 00:16:33,660 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:16:33,668 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:16:33,669 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:16:33,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:16:33 BoogieIcfgContainer [2025-02-08 00:16:33,670 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:16:33,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:16:33,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:16:33,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:16:33,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:16:31" (1/3) ... [2025-02-08 00:16:33,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b53633d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:16:33, skipping insertion in model container [2025-02-08 00:16:33,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:16:31" (2/3) ... [2025-02-08 00:16:33,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b53633d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:16:33, skipping insertion in model container [2025-02-08 00:16:33,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:16:33" (3/3) ... [2025-02-08 00:16:33,680 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p15.c [2025-02-08 00:16:33,694 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:16:33,696 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p15.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:16:33,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:16:33,754 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;@66cdfd3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:16:33,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:16:33,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:33,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 00:16:33,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:33,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 00:16:33,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:33,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:33,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-08 00:16:33,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:16:33,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [90054948] [2025-02-08 00:16:33,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:33,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:16:33,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:16:33,777 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-08 00:16:33,778 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-08 00:16:34,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:16:34,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:16:34,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:34,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:34,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 00:16:34,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:16:34,228 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-08 00:16:34,228 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:16:34,229 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:16:34,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90054948] [2025-02-08 00:16:34,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90054948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:34,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:34,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:16:34,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434953657] [2025-02-08 00:16:34,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:34,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:16:34,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:16:34,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:16:34,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:16:34,255 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:34,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:34,329 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-08 00:16:34,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:16:34,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 00:16:34,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:34,336 INFO L225 Difference]: With dead ends: 16 [2025-02-08 00:16:34,337 INFO L226 Difference]: Without dead ends: 9 [2025-02-08 00:16:34,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:16:34,343 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:34,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:16:34,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-08 00:16:34,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-08 00:16:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:34,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-08 00:16:34,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-08 00:16:34,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:34,373 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-08 00:16:34,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:34,373 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-08 00:16:34,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 00:16:34,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:34,374 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 00:16:34,384 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-08 00:16:34,575 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-08 00:16:34,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:34,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:34,576 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-08 00:16:34,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:16:34,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [650040392] [2025-02-08 00:16:34,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:34,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:16:34,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:16:34,580 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-08 00:16:34,581 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-08 00:16:34,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 00:16:34,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 00:16:34,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:34,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:34,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 00:16:34,976 INFO L279 TraceCheckSpWp]: Computing forward predicates...