./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:52:39,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:52:39,559 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:52:39,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:52:39,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:52:39,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:52:39,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:52:39,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:52:39,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:52:39,589 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:52:39,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:52:39,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:52:39,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:52:39,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:52:39,590 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:52:39,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:52:39,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:52:39,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:52:39,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:52:39,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:52:39,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:52:39,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:52:39,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:52:39,591 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:52:39,591 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:52:39,591 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:52:39,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:52:39,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:52:39,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:52:39,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:52:39,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:52:39,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:52:39,592 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:52:39,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:52:39,592 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:52:39,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:52:39,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:52:39,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:52:39,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:52:39,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:52:39,593 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b [2025-03-03 17:52:39,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:52:39,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:52:39,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:52:39,808 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:52:39,808 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:52:39,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2025-03-03 17:52:40,899 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/884f98635/ae108c756cf546638f4277b73164faac/FLAG279bf9ddd [2025-03-03 17:52:41,133 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:52:41,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2025-03-03 17:52:41,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/884f98635/ae108c756cf546638f4277b73164faac/FLAG279bf9ddd [2025-03-03 17:52:41,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/884f98635/ae108c756cf546638f4277b73164faac [2025-03-03 17:52:41,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:52:41,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:52:41,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:52:41,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:52:41,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:52:41,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:52:41" (1/1) ... [2025-03-03 17:52:41,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48531b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:41, skipping insertion in model container [2025-03-03 17:52:41,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:52:41" (1/1) ... [2025-03-03 17:52:41,189 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:52:41,290 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2025-03-03 17:52:41,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:52:41,384 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:52:41,396 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2025-03-03 17:52:41,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:52:41,446 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:52:41,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:41 WrapperNode [2025-03-03 17:52:41,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:52:41,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:52:41,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:52:41,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:52:41,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:41" (1/1) ... [2025-03-03 17:52:41,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:41" (1/1) ... [2025-03-03 17:52:41,522 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 642 [2025-03-03 17:52:41,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:52:41,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:52:41,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:52:41,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:52:41,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:41" (1/1) ... [2025-03-03 17:52:41,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:41" (1/1) ... [2025-03-03 17:52:41,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:41" (1/1) ... [2025-03-03 17:52:41,568 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-03 17:52:41,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:41" (1/1) ... [2025-03-03 17:52:41,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:41" (1/1) ... [2025-03-03 17:52:41,591 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:41" (1/1) ... [2025-03-03 17:52:41,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:41" (1/1) ... [2025-03-03 17:52:41,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:41" (1/1) ... [2025-03-03 17:52:41,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:41" (1/1) ... [2025-03-03 17:52:41,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:52:41,622 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:52:41,622 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:52:41,622 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:52:41,623 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:41" (1/1) ... [2025-03-03 17:52:41,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:52:41,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:52:41,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:52:41,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:52:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:52:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:52:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 17:52:41,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:52:41,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:52:41,763 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:52:41,764 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:52:42,425 INFO L? ?]: Removed 297 outVars from TransFormulas that were not future-live. [2025-03-03 17:52:42,425 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:52:42,470 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:52:42,472 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:52:42,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:52:42 BoogieIcfgContainer [2025-03-03 17:52:42,473 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:52:42,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:52:42,475 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:52:42,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:52:42,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:52:41" (1/3) ... [2025-03-03 17:52:42,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b581fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:52:42, skipping insertion in model container [2025-03-03 17:52:42,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:41" (2/3) ... [2025-03-03 17:52:42,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b581fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:52:42, skipping insertion in model container [2025-03-03 17:52:42,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:52:42" (3/3) ... [2025-03-03 17:52:42,480 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul4.c [2025-03-03 17:52:42,491 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:52:42,492 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul4.c that has 1 procedures, 182 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:52:42,535 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:52:42,545 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;@76dbc430, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:52:42,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:52:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 182 states, 180 states have (on average 1.4944444444444445) internal successors, (269), 181 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 17:52:42,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:42,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:52:42,557 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:42,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:42,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1353558374, now seen corresponding path program 1 times [2025-03-03 17:52:42,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:42,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490149331] [2025-03-03 17:52:42,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:42,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:42,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 17:52:42,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 17:52:42,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:42,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:52:43,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:43,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490149331] [2025-03-03 17:52:43,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490149331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:43,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:43,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:52:43,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228289776] [2025-03-03 17:52:43,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:43,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:52:43,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:43,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:52:43,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:52:43,241 INFO L87 Difference]: Start difference. First operand has 182 states, 180 states have (on average 1.4944444444444445) internal successors, (269), 181 states have internal predecessors, (269), 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 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:43,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:43,384 INFO L93 Difference]: Finished difference Result 297 states and 441 transitions. [2025-03-03 17:52:43,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:52:43,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2025-03-03 17:52:43,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:43,395 INFO L225 Difference]: With dead ends: 297 [2025-03-03 17:52:43,396 INFO L226 Difference]: Without dead ends: 181 [2025-03-03 17:52:43,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:52:43,400 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:43,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:52:43,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-03 17:52:43,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-03 17:52:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 267 transitions. [2025-03-03 17:52:43,435 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 267 transitions. Word has length 65 [2025-03-03 17:52:43,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:43,436 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 267 transitions. [2025-03-03 17:52:43,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:43,436 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 267 transitions. [2025-03-03 17:52:43,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 17:52:43,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:43,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:52:43,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:52:43,438 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:43,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:43,438 INFO L85 PathProgramCache]: Analyzing trace with hash -984684130, now seen corresponding path program 1 times [2025-03-03 17:52:43,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:43,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288049677] [2025-03-03 17:52:43,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:43,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:43,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 17:52:43,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 17:52:43,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:43,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:52:43,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:43,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288049677] [2025-03-03 17:52:43,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288049677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:43,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:43,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:52:43,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910055498] [2025-03-03 17:52:43,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:43,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:52:43,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:43,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:52:43,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:52:43,652 INFO L87 Difference]: Start difference. First operand 181 states and 267 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:43,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:43,759 INFO L93 Difference]: Finished difference Result 298 states and 439 transitions. [2025-03-03 17:52:43,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:52:43,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2025-03-03 17:52:43,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:43,761 INFO L225 Difference]: With dead ends: 298 [2025-03-03 17:52:43,761 INFO L226 Difference]: Without dead ends: 183 [2025-03-03 17:52:43,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:52:43,762 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:43,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 652 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:52:43,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-03 17:52:43,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-03-03 17:52:43,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.478021978021978) internal successors, (269), 182 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 269 transitions. [2025-03-03 17:52:43,774 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 269 transitions. Word has length 66 [2025-03-03 17:52:43,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:43,774 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 269 transitions. [2025-03-03 17:52:43,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:43,774 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 269 transitions. [2025-03-03 17:52:43,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 17:52:43,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:43,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:52:43,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:52:43,776 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:43,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:43,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1471072353, now seen corresponding path program 1 times [2025-03-03 17:52:43,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:43,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101060543] [2025-03-03 17:52:43,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:43,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:43,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 17:52:43,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 17:52:43,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:43,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:44,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:52:44,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:44,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101060543] [2025-03-03 17:52:44,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101060543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:44,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:44,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:52:44,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901035387] [2025-03-03 17:52:44,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:44,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:52:44,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:44,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:52:44,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:52:44,073 INFO L87 Difference]: Start difference. First operand 183 states and 269 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:44,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:44,189 INFO L93 Difference]: Finished difference Result 304 states and 446 transitions. [2025-03-03 17:52:44,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:52:44,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2025-03-03 17:52:44,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:44,191 INFO L225 Difference]: With dead ends: 304 [2025-03-03 17:52:44,191 INFO L226 Difference]: Without dead ends: 187 [2025-03-03 17:52:44,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:52:44,192 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 212 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:44,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 650 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:52:44,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-03 17:52:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2025-03-03 17:52:44,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.4702702702702704) internal successors, (272), 185 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 272 transitions. [2025-03-03 17:52:44,207 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 272 transitions. Word has length 67 [2025-03-03 17:52:44,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:44,207 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 272 transitions. [2025-03-03 17:52:44,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 272 transitions. [2025-03-03 17:52:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 17:52:44,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:44,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:52:44,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:52:44,208 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:44,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:44,209 INFO L85 PathProgramCache]: Analyzing trace with hash -758376818, now seen corresponding path program 1 times [2025-03-03 17:52:44,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:44,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990051104] [2025-03-03 17:52:44,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:44,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:44,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 17:52:44,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 17:52:44,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:44,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:44,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:52:44,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:44,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990051104] [2025-03-03 17:52:44,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990051104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:44,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:44,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:52:44,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761639783] [2025-03-03 17:52:44,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:44,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:52:44,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:44,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:52:44,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:52:44,960 INFO L87 Difference]: Start difference. First operand 186 states and 272 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:45,164 INFO L93 Difference]: Finished difference Result 329 states and 479 transitions. [2025-03-03 17:52:45,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:52:45,165 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 68 [2025-03-03 17:52:45,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:45,166 INFO L225 Difference]: With dead ends: 329 [2025-03-03 17:52:45,167 INFO L226 Difference]: Without dead ends: 209 [2025-03-03 17:52:45,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:52:45,170 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 24 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:45,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1280 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:52:45,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-03 17:52:45,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 194. [2025-03-03 17:52:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 193 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2025-03-03 17:52:45,182 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 68 [2025-03-03 17:52:45,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:45,182 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2025-03-03 17:52:45,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2025-03-03 17:52:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 17:52:45,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:45,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:52:45,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:52:45,186 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:45,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:45,187 INFO L85 PathProgramCache]: Analyzing trace with hash 678438958, now seen corresponding path program 1 times [2025-03-03 17:52:45,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:45,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488525070] [2025-03-03 17:52:45,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:45,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:45,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 17:52:45,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 17:52:45,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:45,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:45,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:52:45,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:45,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488525070] [2025-03-03 17:52:45,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488525070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:45,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:45,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:52:45,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969987160] [2025-03-03 17:52:45,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:45,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:52:45,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:45,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:52:45,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:52:45,490 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:45,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:45,657 INFO L93 Difference]: Finished difference Result 428 states and 620 transitions. [2025-03-03 17:52:45,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:52:45,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 69 [2025-03-03 17:52:45,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:45,658 INFO L225 Difference]: With dead ends: 428 [2025-03-03 17:52:45,659 INFO L226 Difference]: Without dead ends: 300 [2025-03-03 17:52:45,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:52:45,660 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 476 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:45,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 841 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:52:45,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-03 17:52:45,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 218. [2025-03-03 17:52:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.4608294930875576) internal successors, (317), 217 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 317 transitions. [2025-03-03 17:52:45,666 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 317 transitions. Word has length 69 [2025-03-03 17:52:45,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:45,666 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 317 transitions. [2025-03-03 17:52:45,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:45,666 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 317 transitions. [2025-03-03 17:52:45,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 17:52:45,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:45,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:52:45,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:52:45,667 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:45,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:45,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1515348344, now seen corresponding path program 1 times [2025-03-03 17:52:45,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:45,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167671115] [2025-03-03 17:52:45,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:45,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:45,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 17:52:45,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 17:52:45,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:45,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:52:45,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:45,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167671115] [2025-03-03 17:52:45,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167671115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:45,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:45,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:52:45,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665060044] [2025-03-03 17:52:45,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:45,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:52:45,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:45,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:52:45,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:52:45,908 INFO L87 Difference]: Start difference. First operand 218 states and 317 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:46,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:46,048 INFO L93 Difference]: Finished difference Result 438 states and 633 transitions. [2025-03-03 17:52:46,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:52:46,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 69 [2025-03-03 17:52:46,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:46,049 INFO L225 Difference]: With dead ends: 438 [2025-03-03 17:52:46,049 INFO L226 Difference]: Without dead ends: 310 [2025-03-03 17:52:46,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:52:46,050 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 496 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:46,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 636 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:52:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-03 17:52:46,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 228. [2025-03-03 17:52:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.4537444933920705) internal successors, (330), 227 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 330 transitions. [2025-03-03 17:52:46,060 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 330 transitions. Word has length 69 [2025-03-03 17:52:46,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:46,061 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 330 transitions. [2025-03-03 17:52:46,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:46,061 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 330 transitions. [2025-03-03 17:52:46,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 17:52:46,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:46,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:52:46,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:52:46,061 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:46,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:46,062 INFO L85 PathProgramCache]: Analyzing trace with hash -991139331, now seen corresponding path program 1 times [2025-03-03 17:52:46,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:46,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750594471] [2025-03-03 17:52:46,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:46,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:46,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 17:52:46,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 17:52:46,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:46,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:52:46,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:46,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750594471] [2025-03-03 17:52:46,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750594471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:46,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:46,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:52:46,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400152385] [2025-03-03 17:52:46,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:46,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:52:46,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:46,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:52:46,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:52:46,542 INFO L87 Difference]: Start difference. First operand 228 states and 330 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:46,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:46,713 INFO L93 Difference]: Finished difference Result 374 states and 541 transitions. [2025-03-03 17:52:46,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:52:46,713 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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 69 [2025-03-03 17:52:46,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:46,714 INFO L225 Difference]: With dead ends: 374 [2025-03-03 17:52:46,715 INFO L226 Difference]: Without dead ends: 246 [2025-03-03 17:52:46,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:52:46,716 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 21 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:46,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1071 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:52:46,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-03 17:52:46,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 234. [2025-03-03 17:52:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.4506437768240343) internal successors, (338), 233 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 338 transitions. [2025-03-03 17:52:46,722 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 338 transitions. Word has length 69 [2025-03-03 17:52:46,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:46,723 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 338 transitions. [2025-03-03 17:52:46,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:46,723 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 338 transitions. [2025-03-03 17:52:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 17:52:46,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:46,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:52:46,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:52:46,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:46,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:46,726 INFO L85 PathProgramCache]: Analyzing trace with hash 14202770, now seen corresponding path program 1 times [2025-03-03 17:52:46,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:46,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497730940] [2025-03-03 17:52:46,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:46,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:46,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 17:52:46,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 17:52:46,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:46,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:52:47,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:47,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497730940] [2025-03-03 17:52:47,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497730940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:47,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:47,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:52:47,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619284209] [2025-03-03 17:52:47,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:47,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:52:47,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:47,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:52:47,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:52:47,087 INFO L87 Difference]: Start difference. First operand 234 states and 338 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:47,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:47,302 INFO L93 Difference]: Finished difference Result 366 states and 529 transitions. [2025-03-03 17:52:47,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:52:47,303 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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 69 [2025-03-03 17:52:47,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:47,304 INFO L225 Difference]: With dead ends: 366 [2025-03-03 17:52:47,304 INFO L226 Difference]: Without dead ends: 232 [2025-03-03 17:52:47,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:52:47,305 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 206 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:47,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1426 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:52:47,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-03 17:52:47,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2025-03-03 17:52:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.4517543859649122) internal successors, (331), 228 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 331 transitions. [2025-03-03 17:52:47,309 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 331 transitions. Word has length 69 [2025-03-03 17:52:47,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:47,309 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 331 transitions. [2025-03-03 17:52:47,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 331 transitions. [2025-03-03 17:52:47,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 17:52:47,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:47,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:52:47,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 17:52:47,310 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:47,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:47,311 INFO L85 PathProgramCache]: Analyzing trace with hash 773350963, now seen corresponding path program 1 times [2025-03-03 17:52:47,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:47,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256136373] [2025-03-03 17:52:47,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:47,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:47,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 17:52:47,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 17:52:47,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:47,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:47,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:52:47,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:47,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256136373] [2025-03-03 17:52:47,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256136373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:47,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:47,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:52:47,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008939484] [2025-03-03 17:52:47,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:47,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:52:47,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:47,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:52:47,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:52:47,533 INFO L87 Difference]: Start difference. First operand 229 states and 331 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:47,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:47,650 INFO L93 Difference]: Finished difference Result 399 states and 570 transitions. [2025-03-03 17:52:47,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:52:47,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 69 [2025-03-03 17:52:47,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:47,652 INFO L225 Difference]: With dead ends: 399 [2025-03-03 17:52:47,652 INFO L226 Difference]: Without dead ends: 266 [2025-03-03 17:52:47,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:52:47,653 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 292 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:47,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 633 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:52:47,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-03 17:52:47,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 227. [2025-03-03 17:52:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4424778761061947) internal successors, (326), 226 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 326 transitions. [2025-03-03 17:52:47,659 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 326 transitions. Word has length 69 [2025-03-03 17:52:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:47,659 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 326 transitions. [2025-03-03 17:52:47,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 326 transitions. [2025-03-03 17:52:47,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 17:52:47,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:47,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:52:47,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 17:52:47,660 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:47,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:47,661 INFO L85 PathProgramCache]: Analyzing trace with hash -337684631, now seen corresponding path program 1 times [2025-03-03 17:52:47,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:47,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309305716] [2025-03-03 17:52:47,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:47,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:47,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 17:52:47,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 17:52:47,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:47,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:52:47,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:52:47,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309305716] [2025-03-03 17:52:47,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309305716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:47,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:47,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:52:47,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508153752] [2025-03-03 17:52:47,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:47,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:52:47,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:52:47,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:52:47,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:52:47,897 INFO L87 Difference]: Start difference. First operand 227 states and 326 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:48,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:48,007 INFO L93 Difference]: Finished difference Result 356 states and 512 transitions. [2025-03-03 17:52:48,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:52:48,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 69 [2025-03-03 17:52:48,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:48,009 INFO L225 Difference]: With dead ends: 356 [2025-03-03 17:52:48,009 INFO L226 Difference]: Without dead ends: 219 [2025-03-03 17:52:48,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:52:48,009 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 263 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:48,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 634 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:52:48,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-03 17:52:48,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-03 17:52:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.4495412844036697) internal successors, (316), 218 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 316 transitions. [2025-03-03 17:52:48,018 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 316 transitions. Word has length 69 [2025-03-03 17:52:48,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:48,019 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 316 transitions. [2025-03-03 17:52:48,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:48,019 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 316 transitions. [2025-03-03 17:52:48,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 17:52:48,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:48,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:52:48,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 17:52:48,019 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:48,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:48,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1323306365, now seen corresponding path program 1 times [2025-03-03 17:52:48,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:52:48,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652611138] [2025-03-03 17:52:48,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:48,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:52:48,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 17:52:48,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 17:52:48,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:48,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:52:48,053 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:52:48,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 17:52:48,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 17:52:48,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:48,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:52:48,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:52:48,103 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:52:48,104 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:52:48,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 17:52:48,107 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:52:48,144 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:52:48,161 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:52:48,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:52:48 BoogieIcfgContainer [2025-03-03 17:52:48,164 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:52:48,165 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:52:48,165 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:52:48,165 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:52:48,166 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:52:42" (3/4) ... [2025-03-03 17:52:48,167 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:52:48,168 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:52:48,169 INFO L158 Benchmark]: Toolchain (without parser) took 7007.20ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 129.9MB in the beginning and 276.1MB in the end (delta: -146.2MB). Peak memory consumption was 171.8MB. Max. memory is 16.1GB. [2025-03-03 17:52:48,169 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory was 129.1MB in the beginning and 128.8MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:52:48,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.31ms. Allocated memory is still 167.8MB. Free memory was 129.9MB in the beginning and 112.9MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:52:48,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.00ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 103.7MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:52:48,171 INFO L158 Benchmark]: Boogie Preprocessor took 98.61ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 98.9MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:52:48,171 INFO L158 Benchmark]: IcfgBuilder took 850.74ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 105.9MB in the end (delta: -7.5MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. [2025-03-03 17:52:48,172 INFO L158 Benchmark]: TraceAbstraction took 5690.44ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 105.1MB in the beginning and 276.1MB in the end (delta: -171.0MB). Peak memory consumption was 146.1MB. Max. memory is 16.1GB. [2025-03-03 17:52:48,172 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 486.5MB. Free memory was 276.1MB in the beginning and 276.1MB in the end (delta: 22.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:52:48,173 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory was 129.1MB in the beginning and 128.8MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.31ms. Allocated memory is still 167.8MB. Free memory was 129.9MB in the beginning and 112.9MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.00ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 103.7MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.61ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 98.9MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 850.74ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 105.9MB in the end (delta: -7.5MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5690.44ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 105.1MB in the beginning and 276.1MB in the end (delta: -171.0MB). Peak memory consumption was 146.1MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 486.5MB. Free memory was 276.1MB in the beginning and 276.1MB in the end (delta: 22.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 168. 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 - 32); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (32 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 64); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (64 - 1); [L35] const SORT_64 mask_SORT_64 = (SORT_64)-1 >> (sizeof(SORT_64) * 8 - 4); [L36] const SORT_64 msb_SORT_64 = (SORT_64)1 << (4 - 1); [L38] const SORT_66 mask_SORT_66 = (SORT_66)-1 >> (sizeof(SORT_66) * 8 - 60); [L39] const SORT_66 msb_SORT_66 = (SORT_66)1 << (60 - 1); [L41] const SORT_10 var_11 = 0; [L42] const SORT_1 var_14 = 0; [L43] const SORT_3 var_24 = 0; [L44] const SORT_1 var_51 = 1; [L45] const SORT_64 var_65 = 0; [L47] SORT_1 input_2; [L48] SORT_3 input_4; [L49] SORT_3 input_5; [L50] SORT_1 input_6; [L51] SORT_1 input_7; [L52] SORT_1 input_8; [L53] SORT_1 input_9; [L55] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L55] SORT_10 state_12 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L56] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L57] SORT_10 state_18 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L58] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L59] SORT_3 state_25 = __VERIFIER_nondet_uint() & mask_SORT_3; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L60] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L61] SORT_3 state_30 = __VERIFIER_nondet_uint() & mask_SORT_3; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L62] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L63] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L63] SORT_3 state_37 = __VERIFIER_nondet_uint() & mask_SORT_3; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L64] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L65] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L65] SORT_3 state_42 = __VERIFIER_nondet_uint() & mask_SORT_3; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L66] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L67] SORT_1 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L68] SORT_1 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L69] SORT_1 state_87 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L70] SORT_1 state_92 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] SORT_10 init_13_arg_1 = var_11; [L73] state_12 = init_13_arg_1 [L74] SORT_1 init_16_arg_1 = var_14; [L75] state_15 = init_16_arg_1 [L76] SORT_10 init_19_arg_1 = var_11; [L77] state_18 = init_19_arg_1 [L78] SORT_1 init_21_arg_1 = var_14; [L79] state_20 = init_21_arg_1 [L80] SORT_3 init_26_arg_1 = var_24; [L81] state_25 = init_26_arg_1 [L82] SORT_1 init_28_arg_1 = var_14; [L83] state_27 = init_28_arg_1 [L84] SORT_3 init_31_arg_1 = var_24; [L85] state_30 = init_31_arg_1 [L86] SORT_1 init_33_arg_1 = var_14; [L87] state_32 = init_33_arg_1 [L88] SORT_3 init_38_arg_1 = var_24; [L89] state_37 = init_38_arg_1 [L90] SORT_1 init_40_arg_1 = var_14; [L91] state_39 = init_40_arg_1 [L92] SORT_3 init_43_arg_1 = var_24; [L93] state_42 = init_43_arg_1 [L94] SORT_1 init_45_arg_1 = var_14; [L95] state_44 = init_45_arg_1 [L96] SORT_1 init_70_arg_1 = var_14; [L97] state_69 = init_70_arg_1 [L98] SORT_1 init_75_arg_1 = var_14; [L99] state_74 = init_75_arg_1 [L100] SORT_1 init_88_arg_1 = var_14; [L101] state_87 = init_88_arg_1 [L102] SORT_1 init_93_arg_1 = var_14; [L103] state_92 = init_93_arg_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L106] input_2 = __VERIFIER_nondet_uchar() [L107] input_4 = __VERIFIER_nondet_uint() [L108] input_5 = __VERIFIER_nondet_uint() [L109] input_6 = __VERIFIER_nondet_uchar() [L110] EXPR input_6 & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L110] input_6 = input_6 & mask_SORT_1 [L111] input_7 = __VERIFIER_nondet_uchar() [L112] EXPR input_7 & mask_SORT_1 VAL [input_6=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L112] input_7 = input_7 & mask_SORT_1 [L113] input_8 = __VERIFIER_nondet_uchar() [L114] EXPR input_8 & mask_SORT_1 VAL [input_6=0, input_7=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L114] input_8 = input_8 & mask_SORT_1 [L115] input_9 = __VERIFIER_nondet_uchar() [L116] EXPR input_9 & mask_SORT_1 VAL [input_6=0, input_7=0, input_8=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L116] input_9 = input_9 & mask_SORT_1 [L119] SORT_1 var_17_arg_0 = state_15; [L120] SORT_10 var_17_arg_1 = state_12; [L121] SORT_10 var_17_arg_2 = var_11; [L122] SORT_10 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_24=0, var_51=1, var_65=0] [L123] EXPR var_17 & mask_SORT_10 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L123] var_17 = var_17 & mask_SORT_10 [L124] SORT_1 var_22_arg_0 = state_20; [L125] SORT_10 var_22_arg_1 = state_18; [L126] SORT_10 var_22_arg_2 = var_11; [L127] SORT_10 var_22 = var_22_arg_0 ? var_22_arg_1 : var_22_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_22=0, var_24=0, var_51=1, var_65=0] [L128] EXPR var_22 & mask_SORT_10 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_24=0, var_51=1, var_65=0] [L128] var_22 = var_22 & mask_SORT_10 [L129] SORT_10 var_23_arg_0 = var_17; [L130] SORT_10 var_23_arg_1 = var_22; [L131] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L132] SORT_1 var_29_arg_0 = state_27; [L133] SORT_3 var_29_arg_1 = state_25; [L134] SORT_3 var_29_arg_2 = var_24; [L135] SORT_3 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_51=1, var_65=0] [L136] EXPR var_29 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_51=1, var_65=0] [L136] var_29 = var_29 & mask_SORT_3 [L137] SORT_1 var_34_arg_0 = state_32; [L138] SORT_3 var_34_arg_1 = state_30; [L139] SORT_3 var_34_arg_2 = var_24; [L140] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_34=0, var_51=1, var_65=0] [L141] EXPR var_34 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_51=1, var_65=0] [L141] var_34 = var_34 & mask_SORT_3 [L142] SORT_3 var_35_arg_0 = var_29; [L143] SORT_3 var_35_arg_1 = var_34; [L144] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L145] SORT_1 var_36_arg_0 = var_23; [L146] SORT_1 var_36_arg_1 = var_35; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36_arg_0=1, var_36_arg_1=1, var_51=1, var_65=0] [L147] EXPR var_36_arg_0 & var_36_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L147] SORT_1 var_36 = var_36_arg_0 & var_36_arg_1; [L148] SORT_1 var_41_arg_0 = state_39; [L149] SORT_3 var_41_arg_1 = state_37; [L150] SORT_3 var_41_arg_2 = var_24; [L151] SORT_3 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_51=1, var_65=0] [L152] EXPR var_41 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_51=1, var_65=0] [L152] var_41 = var_41 & mask_SORT_3 [L153] SORT_1 var_46_arg_0 = state_44; [L154] SORT_3 var_46_arg_1 = state_42; [L155] SORT_3 var_46_arg_2 = var_24; [L156] SORT_3 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_46=0, var_51=1, var_65=0] [L157] EXPR var_46 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_51=1, var_65=0] [L157] var_46 = var_46 & mask_SORT_3 [L158] SORT_3 var_47_arg_0 = var_41; [L159] SORT_3 var_47_arg_1 = var_46; [L160] SORT_1 var_47 = var_47_arg_0 == var_47_arg_1; [L161] SORT_1 var_48_arg_0 = var_36; [L162] SORT_1 var_48_arg_1 = var_47; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_48_arg_0=1, var_48_arg_1=1, var_51=1, var_65=0] [L163] EXPR var_48_arg_0 & var_48_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L163] SORT_1 var_48 = var_48_arg_0 & var_48_arg_1; [L164] SORT_1 var_52_arg_0 = var_48; [L165] SORT_1 var_52 = ~var_52_arg_0; [L166] SORT_1 var_53_arg_0 = var_51; [L167] SORT_1 var_53_arg_1 = var_52; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_53_arg_0=1, var_53_arg_1=-2, var_65=0] [L168] EXPR var_53_arg_0 & var_53_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L168] SORT_1 var_53 = var_53_arg_0 & var_53_arg_1; [L169] EXPR var_53 & mask_SORT_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L169] var_53 = var_53 & mask_SORT_1 [L170] SORT_1 bad_54_arg_0 = var_53; [L171] CALL __VERIFIER_assert(!(bad_54_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 182 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1990 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1990 mSDsluCounter, 8478 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6326 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2125 IncrementalHoareTripleChecker+Invalid, 2135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 2152 mSDtfsCounter, 2125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=7, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 234 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 750 NumberOfCodeBlocks, 750 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 670 ConstructedInterpolants, 0 QuantifiedInterpolants, 1719 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 17:52:48,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:52:49,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:52:50,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:52:50,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:52:50,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:52:50,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:52:50,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:52:50,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:52:50,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:52:50,092 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:52:50,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:52:50,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:52:50,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:52:50,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:52:50,093 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:52:50,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:52:50,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:52:50,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:52:50,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:52:50,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:52:50,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:52:50,095 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:52:50,095 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:52:50,095 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:52:50,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:52:50,095 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:52:50,095 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:52:50,095 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:52:50,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:52:50,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:52:50,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:52:50,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:52:50,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:52:50,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:52:50,096 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:52:50,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:52:50,096 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:52:50,096 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:52:50,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:52:50,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:52:50,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:52:50,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:52:50,096 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b [2025-03-03 17:52:50,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:52:50,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:52:50,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:52:50,338 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:52:50,338 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:52:50,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2025-03-03 17:52:51,478 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31e2a11c/ad5a57cafccd43d58427515f52ef7821/FLAG508d54d67 [2025-03-03 17:52:51,656 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:52:51,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2025-03-03 17:52:51,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31e2a11c/ad5a57cafccd43d58427515f52ef7821/FLAG508d54d67 [2025-03-03 17:52:52,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31e2a11c/ad5a57cafccd43d58427515f52ef7821 [2025-03-03 17:52:52,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:52:52,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:52:52,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:52:52,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:52:52,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:52:52,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:52:52" (1/1) ... [2025-03-03 17:52:52,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2757b2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:52, skipping insertion in model container [2025-03-03 17:52:52,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:52:52" (1/1) ... [2025-03-03 17:52:52,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:52:52,155 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2025-03-03 17:52:52,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:52:52,206 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:52:52,215 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2025-03-03 17:52:52,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:52:52,251 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:52:52,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:52 WrapperNode [2025-03-03 17:52:52,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:52:52,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:52:52,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:52:52,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:52:52,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:52" (1/1) ... [2025-03-03 17:52:52,265 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:52" (1/1) ... [2025-03-03 17:52:52,291 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 298 [2025-03-03 17:52:52,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:52:52,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:52:52,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:52:52,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:52:52,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:52" (1/1) ... [2025-03-03 17:52:52,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:52" (1/1) ... [2025-03-03 17:52:52,301 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:52" (1/1) ... [2025-03-03 17:52:52,314 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-03 17:52:52,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:52" (1/1) ... [2025-03-03 17:52:52,314 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:52" (1/1) ... [2025-03-03 17:52:52,322 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:52" (1/1) ... [2025-03-03 17:52:52,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:52" (1/1) ... [2025-03-03 17:52:52,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:52" (1/1) ... [2025-03-03 17:52:52,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:52" (1/1) ... [2025-03-03 17:52:52,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:52:52,327 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:52:52,327 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:52:52,327 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:52:52,328 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:52" (1/1) ... [2025-03-03 17:52:52,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:52:52,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:52:52,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:52:52,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:52:52,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:52:52,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:52:52,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-03 17:52:52,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:52:52,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:52:52,484 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:52:52,485 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:52:52,831 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-03-03 17:52:52,832 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:52:52,838 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:52:52,839 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:52:52,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:52:52 BoogieIcfgContainer [2025-03-03 17:52:52,839 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:52:52,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:52:52,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:52:52,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:52:52,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:52:52" (1/3) ... [2025-03-03 17:52:52,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4458b8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:52:52, skipping insertion in model container [2025-03-03 17:52:52,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:52:52" (2/3) ... [2025-03-03 17:52:52,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4458b8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:52:52, skipping insertion in model container [2025-03-03 17:52:52,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:52:52" (3/3) ... [2025-03-03 17:52:52,846 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul4.c [2025-03-03 17:52:52,856 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:52:52,858 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul4.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:52:52,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:52:52,900 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;@4afe8da9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:52:52,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:52:52,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:52,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:52:52,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:52,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:52:52,907 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:52,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:52,910 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:52:52,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:52:52,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [100658188] [2025-03-03 17:52:52,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:52,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:52:52,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:52:52,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:52:52,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 17:52:53,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:52:53,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:52:53,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:53,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:53,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-03 17:52:53,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:52:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:52:53,504 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:52:53,507 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:52:53,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100658188] [2025-03-03 17:52:53,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100658188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:52:53,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:52:53,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:52:53,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540963103] [2025-03-03 17:52:53,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:52:53,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:52:53,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:52:53,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:52:53,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:52:53,527 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:52:53,659 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-03-03 17:52:53,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:52:53,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 17:52:53,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:52:53,667 INFO L225 Difference]: With dead ends: 17 [2025-03-03 17:52:53,667 INFO L226 Difference]: Without dead ends: 9 [2025-03-03 17:52:53,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:52:53,672 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:52:53,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:52:53,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-03 17:52:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-03 17:52:53,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:52:53,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:52:53,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:52:53,693 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:52:53,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:52:53,693 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:52:53,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:52:53,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:52:53,693 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:52:53,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 17:52:53,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:52:53,898 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:52:53,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:52:53,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:52:53,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:52:53,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1004740153] [2025-03-03 17:52:53,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:52:53,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:52:53,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:52:53,903 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:52:53,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 17:52:53,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:52:54,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:52:54,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:52:54,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:52:54,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-03-03 17:52:54,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:52:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:52:55,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:53:07,690 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse12 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_92~0#1|)) (.cse39 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_74~0#1|))) (let ((.cse40 (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |c_ULTIMATE.start_main_~state_42~0#1|)) (.cse18 (and (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| (_ BitVec 64))) (not (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|)))) .cse39)) (.cse22 (and (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 64))) (not (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|)))) (not .cse39))) (.cse11 (not .cse12)) (.cse38 (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 64))) (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|)))) (.cse37 (and (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| (_ BitVec 64))) (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|))) .cse39)) (.cse29 (forall ((|v_ULTIMATE.start_main_~var_53_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_0~0#1_10|)))))))))) (let ((.cse30 (or .cse37 .cse29)) (.cse33 (or .cse29 .cse38 .cse39)) (.cse9 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_9~0#1|)) (.cse34 (forall ((|v_ULTIMATE.start_main_~var_53_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_0~0#1_10|))))))))) (.cse26 (and (or .cse12 .cse18) (or .cse22 .cse11))) (.cse28 (and (or .cse38 .cse39) (or .cse12 .cse37))) (.cse36 (or (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 32))) (= .cse40 (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_5~0#1|))) .cse29)) (.cse35 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 32))) (not (= .cse40 (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_5~0#1|)))))) (let ((.cse19 (and .cse36 (or .cse35 .cse29))) (.cse0 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_8~0#1|)) (.cse2 (and (or .cse34 .cse26) (or .cse28 .cse29))) (.cse15 (not .cse9)) (.cse32 (and (or .cse34 .cse22) .cse33)) (.cse31 (and (or .cse34 .cse18) .cse30))) (let ((.cse24 (and (or .cse32 .cse11) (or .cse12 .cse31))) (.cse25 (or .cse2 .cse15)) (.cse3 (not .cse0)) (.cse21 (or .cse38 .cse19 .cse39)) (.cse17 (or .cse37 .cse19)) (.cse27 (and (or .cse34 .cse35) .cse36)) (.cse20 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_9| (_ BitVec 32))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_4~0#1|) (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |v_ULTIMATE.start_main_~state_30~0#1_9|))))) (.cse16 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_9| (_ BitVec 32))) (= (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |ULTIMATE.start_main_~input_4~0#1|) (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |v_ULTIMATE.start_main_~state_30~0#1_9|))))) (let ((.cse1 (and (or .cse12 (and (or (and (or .cse29 .cse18) .cse30) .cse16) (or .cse31 .cse20))) (or (and (or .cse32 .cse20) (or (and .cse33 (or .cse22 .cse29)) .cse16)) .cse11))) (.cse13 (and .cse17 (or .cse18 .cse27))) (.cse10 (and .cse21 (or .cse22 .cse27))) (.cse8 (or (and .cse25 (or .cse9 (and (or .cse26 .cse27) (or .cse28 .cse19)))) .cse3)) (.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_8~0#1|)) (.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_9~0#1|)) (.cse14 (or .cse15 .cse24))) (and (or (and (or .cse0 .cse1) (or .cse2 .cse3)) (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse4 .cse5))) .cse6))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse5 .cse7))))))))))) (or (and .cse8 (or .cse0 (and (or .cse9 (and (or .cse10 .cse11) (or .cse12 .cse13))) .cse14))) (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|))))))) .cse6)))))) (or (and (or .cse0 (and (or .cse15 .cse1) (or .cse9 (and (or .cse12 (and (or .cse16 (and .cse17 (or .cse18 .cse19))) (or .cse13 .cse20))) (or (and (or .cse10 .cse20) (or .cse16 (and .cse21 (or .cse22 .cse19)))) .cse11))))) .cse8) (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse4 .cse23))) .cse6)))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse23 .cse7))))))))))) (or (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|))))))) .cse6)))) (and (or .cse0 (and (or .cse9 .cse24) .cse14)) (or (and .cse25 (or .cse9 .cse2)) .cse3)))))))))) is different from false [2025-03-03 17:53:50,261 WARN L286 SmtUtils]: Spent 22.23s on a formula simplification that was a NOOP. DAG size: 191 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)