./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 81099e1fe8016daaefd672ebf53a7cbfe30573425760bd713b63c430b338ca02 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:17:07,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:17:07,821 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 08:17:07,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:17:07,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:17:07,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:17:07,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:17:07,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:17:07,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:17:07,861 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:17:07,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:17:07,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:17:07,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:17:07,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:17:07,862 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:17:07,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:17:07,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:17:07,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:17:07,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:17:07,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:17:07,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:17:07,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:17:07,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:17:07,863 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:17:07,864 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:17:07,864 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:17:07,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:17:07,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:17:07,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:17:07,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:17:07,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:17:07,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:17:07,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:17:07,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:17:07,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:17:07,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:17:07,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:17:07,865 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:17:07,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:17:07,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:17:07,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:17:07,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:17:07,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:17:07,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:17:07,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:17:07,866 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 81099e1fe8016daaefd672ebf53a7cbfe30573425760bd713b63c430b338ca02 [2025-01-09 08:17:08,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:17:08,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:17:08,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:17:08,185 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:17:08,185 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:17:08,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c [2025-01-09 08:17:09,519 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77debce6e/acfad9fe6d8448e8b1a8ccdac215a46c/FLAG9db2b742a [2025-01-09 08:17:09,827 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:17:09,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c [2025-01-09 08:17:09,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77debce6e/acfad9fe6d8448e8b1a8ccdac215a46c/FLAG9db2b742a [2025-01-09 08:17:09,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77debce6e/acfad9fe6d8448e8b1a8ccdac215a46c [2025-01-09 08:17:09,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:17:09,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:17:09,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:17:09,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:17:09,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:17:09,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:17:09" (1/1) ... [2025-01-09 08:17:09,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@248f082d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:09, skipping insertion in model container [2025-01-09 08:17:09,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:17:09" (1/1) ... [2025-01-09 08:17:09,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:17:10,053 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c[1266,1279] [2025-01-09 08:17:10,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:17:10,199 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:17:10,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c[1266,1279] [2025-01-09 08:17:10,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:17:10,296 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:17:10,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:10 WrapperNode [2025-01-09 08:17:10,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:17:10,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:17:10,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:17:10,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:17:10,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:10" (1/1) ... [2025-01-09 08:17:10,327 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:10" (1/1) ... [2025-01-09 08:17:10,433 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 731 [2025-01-09 08:17:10,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:17:10,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:17:10,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:17:10,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:17:10,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:10" (1/1) ... [2025-01-09 08:17:10,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:10" (1/1) ... [2025-01-09 08:17:10,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:10" (1/1) ... [2025-01-09 08:17:10,511 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 08:17:10,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:10" (1/1) ... [2025-01-09 08:17:10,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:10" (1/1) ... [2025-01-09 08:17:10,540 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:10" (1/1) ... [2025-01-09 08:17:10,547 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:10" (1/1) ... [2025-01-09 08:17:10,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:10" (1/1) ... [2025-01-09 08:17:10,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:10" (1/1) ... [2025-01-09 08:17:10,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:10" (1/1) ... [2025-01-09 08:17:10,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:17:10,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:17:10,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:17:10,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:17:10,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:10" (1/1) ... [2025-01-09 08:17:10,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:17:10,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:17:10,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:17:10,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:17:10,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:17:10,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:17:10,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:17:10,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:17:10,821 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:17:10,823 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:17:11,847 INFO L? ?]: Removed 381 outVars from TransFormulas that were not future-live. [2025-01-09 08:17:11,848 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:17:11,862 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:17:11,864 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:17:11,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:17:11 BoogieIcfgContainer [2025-01-09 08:17:11,865 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:17:11,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:17:11,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:17:11,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:17:11,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:17:09" (1/3) ... [2025-01-09 08:17:11,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6984136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:17:11, skipping insertion in model container [2025-01-09 08:17:11,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:10" (2/3) ... [2025-01-09 08:17:11,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6984136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:17:11, skipping insertion in model container [2025-01-09 08:17:11,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:17:11" (3/3) ... [2025-01-09 08:17:11,877 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c [2025-01-09 08:17:11,892 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:17:11,893 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c that has 1 procedures, 142 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:17:11,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:17:11,973 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;@52f3ff11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:17:11,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:17:11,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 141 states have internal predecessors, (209), 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-01-09 08:17:11,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 08:17:11,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:11,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:11,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:11,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:11,993 INFO L85 PathProgramCache]: Analyzing trace with hash 387884158, now seen corresponding path program 1 times [2025-01-09 08:17:11,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:12,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162105393] [2025-01-09 08:17:12,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:12,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:12,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 08:17:12,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 08:17:12,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:12,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:12,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:12,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:12,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162105393] [2025-01-09 08:17:12,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162105393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:12,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:12,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:17:12,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544676137] [2025-01-09 08:17:12,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:12,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:17:12,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:12,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:17:12,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:17:12,845 INFO L87 Difference]: Start difference. First operand has 142 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 141 states have internal predecessors, (209), 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 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-01-09 08:17:12,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:12,919 INFO L93 Difference]: Finished difference Result 229 states and 339 transitions. [2025-01-09 08:17:12,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:17:12,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2025-01-09 08:17:12,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:12,934 INFO L225 Difference]: With dead ends: 229 [2025-01-09 08:17:12,934 INFO L226 Difference]: Without dead ends: 141 [2025-01-09 08:17:12,939 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-01-09 08:17:12,942 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:12,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 603 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:17:12,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-09 08:17:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-01-09 08:17:12,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4785714285714286) internal successors, (207), 140 states have internal predecessors, (207), 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-01-09 08:17:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2025-01-09 08:17:12,984 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 41 [2025-01-09 08:17:12,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:12,985 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2025-01-09 08:17:12,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-01-09 08:17:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2025-01-09 08:17:12,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 08:17:12,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:12,987 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] [2025-01-09 08:17:12,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 08:17:12,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:12,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:12,988 INFO L85 PathProgramCache]: Analyzing trace with hash -858797603, now seen corresponding path program 1 times [2025-01-09 08:17:12,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:12,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479583606] [2025-01-09 08:17:12,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:12,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:13,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 08:17:13,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 08:17:13,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:13,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:13,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:13,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479583606] [2025-01-09 08:17:13,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479583606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:13,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:13,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:17:13,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271739319] [2025-01-09 08:17:13,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:13,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:17:13,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:13,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:17:13,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:17:13,246 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-01-09 08:17:13,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:13,294 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2025-01-09 08:17:13,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:17:13,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2025-01-09 08:17:13,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:13,298 INFO L225 Difference]: With dead ends: 230 [2025-01-09 08:17:13,298 INFO L226 Difference]: Without dead ends: 143 [2025-01-09 08:17:13,301 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-01-09 08:17:13,302 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:13,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:17:13,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-09 08:17:13,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-01-09 08:17:13,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.471830985915493) internal successors, (209), 142 states have internal predecessors, (209), 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-01-09 08:17:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2025-01-09 08:17:13,317 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 42 [2025-01-09 08:17:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:13,321 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2025-01-09 08:17:13,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-01-09 08:17:13,321 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2025-01-09 08:17:13,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 08:17:13,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:13,322 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] [2025-01-09 08:17:13,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:17:13,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:13,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:13,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1950887625, now seen corresponding path program 1 times [2025-01-09 08:17:13,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:13,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903535975] [2025-01-09 08:17:13,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:13,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:13,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 08:17:13,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 08:17:13,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:13,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:13,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:13,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903535975] [2025-01-09 08:17:13,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903535975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:13,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:13,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:17:13,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783622014] [2025-01-09 08:17:13,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:13,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:17:13,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:13,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:17:13,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:17:13,750 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-01-09 08:17:13,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:13,904 INFO L93 Difference]: Finished difference Result 236 states and 344 transitions. [2025-01-09 08:17:13,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:17:13,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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 43 [2025-01-09 08:17:13,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:13,909 INFO L225 Difference]: With dead ends: 236 [2025-01-09 08:17:13,909 INFO L226 Difference]: Without dead ends: 147 [2025-01-09 08:17:13,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-09 08:17:13,910 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 178 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:13,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 736 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:17:13,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-09 08:17:13,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2025-01-09 08:17:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.4620689655172414) internal successors, (212), 145 states have internal predecessors, (212), 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-01-09 08:17:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions. [2025-01-09 08:17:13,927 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 43 [2025-01-09 08:17:13,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:13,927 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions. [2025-01-09 08:17:13,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-01-09 08:17:13,928 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2025-01-09 08:17:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 08:17:13,929 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:13,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:13,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:17:13,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:13,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:13,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1216571104, now seen corresponding path program 1 times [2025-01-09 08:17:13,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:13,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505103329] [2025-01-09 08:17:13,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:13,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:13,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 08:17:14,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 08:17:14,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:14,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:14,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:14,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505103329] [2025-01-09 08:17:14,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505103329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:14,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:14,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:17:14,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796644430] [2025-01-09 08:17:14,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:14,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:17:14,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:14,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:17:14,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:17:14,774 INFO L87 Difference]: Start difference. First operand 146 states and 212 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:14,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:14,878 INFO L93 Difference]: Finished difference Result 246 states and 356 transitions. [2025-01-09 08:17:14,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:17:14,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-01-09 08:17:14,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:14,879 INFO L225 Difference]: With dead ends: 246 [2025-01-09 08:17:14,880 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 08:17:14,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:17:14,881 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 190 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:14,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 984 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:17:14,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 08:17:14,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2025-01-09 08:17:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.4533333333333334) internal successors, (218), 150 states have internal predecessors, (218), 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-01-09 08:17:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 218 transitions. [2025-01-09 08:17:14,888 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 218 transitions. Word has length 44 [2025-01-09 08:17:14,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:14,888 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 218 transitions. [2025-01-09 08:17:14,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:14,889 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 218 transitions. [2025-01-09 08:17:14,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 08:17:14,889 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:14,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:14,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:17:14,890 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:14,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:14,891 INFO L85 PathProgramCache]: Analyzing trace with hash 560912804, now seen corresponding path program 1 times [2025-01-09 08:17:14,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:14,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879283578] [2025-01-09 08:17:14,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:14,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:14,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 08:17:14,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 08:17:14,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:14,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:15,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:15,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879283578] [2025-01-09 08:17:15,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879283578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:15,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:15,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:17:15,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845292530] [2025-01-09 08:17:15,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:15,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:17:15,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:15,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:17:15,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:17:15,257 INFO L87 Difference]: Start difference. First operand 151 states and 218 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:15,379 INFO L93 Difference]: Finished difference Result 252 states and 362 transitions. [2025-01-09 08:17:15,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:17:15,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-01-09 08:17:15,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:15,381 INFO L225 Difference]: With dead ends: 252 [2025-01-09 08:17:15,381 INFO L226 Difference]: Without dead ends: 155 [2025-01-09 08:17:15,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:17:15,382 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 176 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:15,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 924 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:17:15,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-09 08:17:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2025-01-09 08:17:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.4533333333333334) internal successors, (218), 150 states have internal predecessors, (218), 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-01-09 08:17:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 218 transitions. [2025-01-09 08:17:15,388 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 218 transitions. Word has length 44 [2025-01-09 08:17:15,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:15,388 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 218 transitions. [2025-01-09 08:17:15,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 218 transitions. [2025-01-09 08:17:15,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 08:17:15,389 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:15,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:15,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:17:15,390 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:15,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:15,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1978279468, now seen corresponding path program 1 times [2025-01-09 08:17:15,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:15,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113766700] [2025-01-09 08:17:15,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:15,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:15,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 08:17:15,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 08:17:15,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:15,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:15,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:17:15,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113766700] [2025-01-09 08:17:15,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113766700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:15,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:15,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:17:15,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444974144] [2025-01-09 08:17:15,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:15,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:17:15,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:17:15,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:17:15,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:17:15,611 INFO L87 Difference]: Start difference. First operand 151 states and 218 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:15,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:15,880 INFO L93 Difference]: Finished difference Result 283 states and 401 transitions. [2025-01-09 08:17:15,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:17:15,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-01-09 08:17:15,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:15,882 INFO L225 Difference]: With dead ends: 283 [2025-01-09 08:17:15,882 INFO L226 Difference]: Without dead ends: 186 [2025-01-09 08:17:15,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:17:15,883 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 237 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:15,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 644 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:17:15,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-01-09 08:17:15,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 159. [2025-01-09 08:17:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.4430379746835442) internal successors, (228), 158 states have internal predecessors, (228), 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-01-09 08:17:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 228 transitions. [2025-01-09 08:17:15,894 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 228 transitions. Word has length 45 [2025-01-09 08:17:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:15,894 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 228 transitions. [2025-01-09 08:17:15,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 228 transitions. [2025-01-09 08:17:15,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 08:17:15,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:15,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:15,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:17:15,895 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:15,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:15,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1772973075, now seen corresponding path program 1 times [2025-01-09 08:17:15,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:17:15,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487446399] [2025-01-09 08:17:15,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:15,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:17:15,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 08:17:15,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 08:17:15,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:15,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:17:15,929 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:17:15,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 08:17:15,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 08:17:15,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:15,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:17:15,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:17:15,997 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:17:15,997 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:17:15,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 08:17:16,002 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:16,058 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:17:16,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:17:16 BoogieIcfgContainer [2025-01-09 08:17:16,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:17:16,065 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:17:16,065 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:17:16,065 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:17:16,067 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:17:11" (3/4) ... [2025-01-09 08:17:16,069 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:17:16,070 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:17:16,071 INFO L158 Benchmark]: Toolchain (without parser) took 6203.84ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 122.0MB in the beginning and 76.0MB in the end (delta: 46.0MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. [2025-01-09 08:17:16,071 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 201.3MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:17:16,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.92ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:17:16,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 136.51ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 87.3MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:17:16,072 INFO L158 Benchmark]: Boogie Preprocessor took 163.62ms. Allocated memory is still 167.8MB. Free memory was 87.3MB in the beginning and 78.6MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:17:16,072 INFO L158 Benchmark]: RCFGBuilder took 1265.21ms. Allocated memory is still 167.8MB. Free memory was 78.6MB in the beginning and 82.3MB in the end (delta: -3.7MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. [2025-01-09 08:17:16,073 INFO L158 Benchmark]: TraceAbstraction took 4197.16ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 81.5MB in the beginning and 76.0MB in the end (delta: 5.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2025-01-09 08:17:16,073 INFO L158 Benchmark]: Witness Printer took 5.22ms. Allocated memory is still 201.3MB. Free memory was 76.0MB in the beginning and 76.0MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:17:16,075 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.45ms. Allocated memory is still 201.3MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.92ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 136.51ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 87.3MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 163.62ms. Allocated memory is still 167.8MB. Free memory was 87.3MB in the beginning and 78.6MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1265.21ms. Allocated memory is still 167.8MB. Free memory was 78.6MB in the beginning and 82.3MB in the end (delta: -3.7MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4197.16ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 81.5MB in the beginning and 76.0MB in the end (delta: 5.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 5.22ms. Allocated memory is still 201.3MB. Free memory was 76.0MB in the beginning and 76.0MB in the end (delta: 25.4kB). 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 169. 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 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L35] const SORT_33 mask_SORT_33 = (SORT_33)-1 >> (sizeof(SORT_33) * 8 - 4); [L36] const SORT_33 msb_SORT_33 = (SORT_33)1 << (4 - 1); [L38] const SORT_69 mask_SORT_69 = (SORT_69)-1 >> (sizeof(SORT_69) * 8 - 10); [L39] const SORT_69 msb_SORT_69 = (SORT_69)1 << (10 - 1); [L41] const SORT_3 var_7 = 0; [L42] const SORT_10 var_12 = 0; [L43] const SORT_1 var_14 = 0; [L44] const SORT_10 var_18 = 1; [L45] const SORT_1 var_23 = 1; [L46] const SORT_69 var_70 = 0; [L47] const SORT_10 var_113 = 104; [L49] SORT_1 input_2; [L50] SORT_3 input_4; [L51] SORT_1 input_5; [L52] SORT_1 input_6; [L53] SORT_1 input_31; [L54] SORT_33 input_34; [L55] SORT_1 input_36; [L56] SORT_33 input_38; [L57] SORT_1 input_40; [L58] SORT_1 input_42; [L59] SORT_1 input_48; [L60] SORT_1 input_50; [L61] SORT_1 input_52; [L62] SORT_1 input_57; [L63] SORT_1 input_67; [L64] SORT_3 input_75; [L65] SORT_1 input_82; [L66] SORT_1 input_89; [L67] SORT_1 input_95; [L68] SORT_1 input_101; [L69] SORT_1 input_107; [L70] SORT_1 input_108; [L71] SORT_1 input_109; [L72] SORT_1 input_126; [L73] SORT_69 input_136; [L74] SORT_1 input_144; [L75] SORT_1 input_145; [L76] SORT_1 input_146; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L78] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L79] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L80] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L81] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L82] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L83] SORT_1 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L84] SORT_1 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L85] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L86] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L87] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L88] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_ushort() & mask_SORT_69 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L89] SORT_69 state_71 = __VERIFIER_nondet_ushort() & mask_SORT_69; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0, var_7=0] [L90] SORT_1 state_73 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] SORT_3 init_9_arg_1 = var_7; [L93] state_8 = init_9_arg_1 [L94] SORT_1 init_16_arg_1 = var_14; [L95] state_15 = init_16_arg_1 [L96] SORT_1 init_28_arg_1 = var_14; [L97] state_27 = init_28_arg_1 [L98] SORT_1 init_30_arg_1 = var_14; [L99] state_29 = init_30_arg_1 [L100] SORT_1 init_45_arg_1 = var_14; [L101] state_44 = init_45_arg_1 [L102] SORT_1 init_47_arg_1 = var_14; [L103] state_46 = init_47_arg_1 [L104] SORT_1 init_55_arg_1 = var_23; [L105] state_54 = init_55_arg_1 [L106] SORT_1 init_60_arg_1 = var_14; [L107] state_59 = init_60_arg_1 [L108] SORT_1 init_62_arg_1 = var_14; [L109] state_61 = init_62_arg_1 [L110] SORT_1 init_64_arg_1 = var_14; [L111] state_63 = init_64_arg_1 [L112] SORT_1 init_66_arg_1 = var_14; [L113] state_65 = init_66_arg_1 [L114] SORT_69 init_72_arg_1 = var_70; [L115] state_71 = init_72_arg_1 [L116] SORT_1 init_74_arg_1 = var_14; [L117] state_73 = init_74_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0] [L120] input_2 = __VERIFIER_nondet_uchar() [L121] input_4 = __VERIFIER_nondet_uchar() [L122] input_5 = __VERIFIER_nondet_uchar() [L123] input_6 = __VERIFIER_nondet_uchar() [L124] input_31 = __VERIFIER_nondet_uchar() [L125] input_34 = __VERIFIER_nondet_uchar() [L126] input_36 = __VERIFIER_nondet_uchar() [L127] input_38 = __VERIFIER_nondet_uchar() [L128] input_40 = __VERIFIER_nondet_uchar() [L129] input_42 = __VERIFIER_nondet_uchar() [L130] input_48 = __VERIFIER_nondet_uchar() [L131] input_50 = __VERIFIER_nondet_uchar() [L132] input_52 = __VERIFIER_nondet_uchar() [L133] input_57 = __VERIFIER_nondet_uchar() [L134] input_67 = __VERIFIER_nondet_uchar() [L135] input_75 = __VERIFIER_nondet_uchar() [L136] input_82 = __VERIFIER_nondet_uchar() [L137] input_89 = __VERIFIER_nondet_uchar() [L138] input_95 = __VERIFIER_nondet_uchar() [L139] input_101 = __VERIFIER_nondet_uchar() [L140] input_107 = __VERIFIER_nondet_uchar() [L141] input_108 = __VERIFIER_nondet_uchar() [L142] input_109 = __VERIFIER_nondet_uchar() [L143] input_126 = __VERIFIER_nondet_uchar() [L144] input_136 = __VERIFIER_nondet_ushort() [L145] input_144 = __VERIFIER_nondet_uchar() [L146] input_145 = __VERIFIER_nondet_uchar() [L147] input_146 = __VERIFIER_nondet_uchar() [L150] SORT_3 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_11_arg_0=0, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0] [L151] EXPR var_11_arg_0 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0] [L151] var_11_arg_0 = var_11_arg_0 & mask_SORT_3 [L152] SORT_10 var_11 = var_11_arg_0; [L153] SORT_10 var_13_arg_0 = var_11; [L154] SORT_10 var_13_arg_1 = var_12; [L155] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L156] SORT_1 var_17_arg_0 = state_15; VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_13=1, var_14=0, var_17_arg_0=0, var_18=1, var_23=1, var_70=0] [L157] EXPR var_17_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_13=1, var_14=0, var_18=1, var_23=1, var_70=0] [L157] var_17_arg_0 = var_17_arg_0 & mask_SORT_1 [L158] SORT_10 var_17 = var_17_arg_0; [L159] SORT_10 var_19_arg_0 = var_17; [L160] SORT_10 var_19_arg_1 = var_18; [L161] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L162] SORT_1 var_20_arg_0 = var_13; [L163] SORT_1 var_20_arg_1 = var_19; VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_20_arg_0=1, var_20_arg_1=0, var_23=1, var_70=0] [L164] EXPR var_20_arg_0 | var_20_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0] [L164] SORT_1 var_20 = var_20_arg_0 | var_20_arg_1; [L165] SORT_1 var_24_arg_0 = var_20; [L166] SORT_1 var_24 = ~var_24_arg_0; [L167] SORT_1 var_25_arg_0 = var_23; [L168] SORT_1 var_25_arg_1 = var_24; VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_25_arg_0=1, var_25_arg_1=-2, var_70=0] [L169] EXPR var_25_arg_0 & var_25_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0] [L169] SORT_1 var_25 = var_25_arg_0 & var_25_arg_1; [L170] EXPR var_25 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=255, mask_SORT_69=1023, state_15=0, state_27=0, state_29=0, state_44=0, state_46=0, state_54=1, state_59=0, state_61=0, state_63=0, state_65=0, state_71=0, state_73=0, state_8=0, var_113=104, var_12=0, var_14=0, var_18=1, var_23=1, var_70=0] [L170] var_25 = var_25 & mask_SORT_1 [L171] SORT_1 bad_26_arg_0 = var_25; [L172] CALL __VERIFIER_assert(!(bad_26_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 781 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 781 mSDsluCounter, 4490 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3315 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 428 IncrementalHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 1175 mSDtfsCounter, 428 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=6, InterpolantAutomatonStates: 33, 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, 6 MinimizatonAttempts, 35 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 751 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 08:17:16,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 81099e1fe8016daaefd672ebf53a7cbfe30573425760bd713b63c430b338ca02 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:17:18,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:17:18,516 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-01-09 08:17:18,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:17:18,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:17:18,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:17:18,558 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:17:18,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:17:18,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:17:18,561 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:17:18,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:17:18,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:17:18,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:17:18,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:17:18,563 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:17:18,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:17:18,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:17:18,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:17:18,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:17:18,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:17:18,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:17:18,564 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:17:18,565 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:17:18,565 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:17:18,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:17:18,565 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:17:18,565 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:17:18,565 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:17:18,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:17:18,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:17:18,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:17:18,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:17:18,566 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:17:18,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:17:18,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:17:18,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:17:18,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:17:18,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:17:18,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:17:18,567 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:17:18,567 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:17:18,567 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:17:18,568 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:17:18,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:17:18,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:17:18,568 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:17:18,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:17:18,568 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 81099e1fe8016daaefd672ebf53a7cbfe30573425760bd713b63c430b338ca02 [2025-01-09 08:17:18,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:17:18,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:17:18,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:17:18,885 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:17:18,886 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:17:18,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c [2025-01-09 08:17:20,266 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92bf3bdcf/8fa08379dc9241d68c52d3ea4defe38c/FLAGa913ccdbe [2025-01-09 08:17:20,547 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:17:20,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c [2025-01-09 08:17:20,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92bf3bdcf/8fa08379dc9241d68c52d3ea4defe38c/FLAGa913ccdbe [2025-01-09 08:17:20,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92bf3bdcf/8fa08379dc9241d68c52d3ea4defe38c [2025-01-09 08:17:20,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:17:20,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:17:20,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:17:20,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:17:20,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:17:20,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:17:20" (1/1) ... [2025-01-09 08:17:20,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5792fa25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:20, skipping insertion in model container [2025-01-09 08:17:20,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:17:20" (1/1) ... [2025-01-09 08:17:20,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:17:20,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c[1266,1279] [2025-01-09 08:17:20,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:17:20,922 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:17:20,932 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c[1266,1279] [2025-01-09 08:17:20,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:17:21,006 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:17:21,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:21 WrapperNode [2025-01-09 08:17:21,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:17:21,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:17:21,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:17:21,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:17:21,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:21" (1/1) ... [2025-01-09 08:17:21,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:21" (1/1) ... [2025-01-09 08:17:21,055 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 467 [2025-01-09 08:17:21,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:17:21,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:17:21,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:17:21,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:17:21,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:21" (1/1) ... [2025-01-09 08:17:21,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:21" (1/1) ... [2025-01-09 08:17:21,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:21" (1/1) ... [2025-01-09 08:17:21,095 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 08:17:21,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:21" (1/1) ... [2025-01-09 08:17:21,096 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:21" (1/1) ... [2025-01-09 08:17:21,110 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:21" (1/1) ... [2025-01-09 08:17:21,112 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:21" (1/1) ... [2025-01-09 08:17:21,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:21" (1/1) ... [2025-01-09 08:17:21,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:21" (1/1) ... [2025-01-09 08:17:21,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:21" (1/1) ... [2025-01-09 08:17:21,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:17:21,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:17:21,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:17:21,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:17:21,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:21" (1/1) ... [2025-01-09 08:17:21,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:17:21,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:17:21,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:17:21,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:17:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:17:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:17:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:17:21,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:17:21,369 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:17:21,371 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:17:21,763 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2025-01-09 08:17:21,765 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:17:21,772 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:17:21,772 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:17:21,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:17:21 BoogieIcfgContainer [2025-01-09 08:17:21,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:17:21,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:17:21,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:17:21,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:17:21,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:17:20" (1/3) ... [2025-01-09 08:17:21,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea959f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:17:21, skipping insertion in model container [2025-01-09 08:17:21,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:17:21" (2/3) ... [2025-01-09 08:17:21,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea959f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:17:21, skipping insertion in model container [2025-01-09 08:17:21,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:17:21" (3/3) ... [2025-01-09 08:17:21,782 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c [2025-01-09 08:17:21,794 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:17:21,795 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p22.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:17:21,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:17:21,850 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;@743356e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:17:21,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:17:21,856 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-01-09 08:17:21,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 08:17:21,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:21,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 08:17:21,862 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:21,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:21,868 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 08:17:21,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:17:21,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1841891421] [2025-01-09 08:17:21,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:21,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:17:21,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:17:21,881 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:17:21,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 08:17:22,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 08:17:22,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 08:17:22,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:22,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:22,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 08:17:22,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:17:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:22,291 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:17:22,292 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:17:22,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841891421] [2025-01-09 08:17:22,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841891421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:17:22,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:17:22,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:17:22,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520358262] [2025-01-09 08:17:22,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:17:22,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:17:22,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:17:22,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:17:22,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:17:22,320 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-01-09 08:17:22,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:22,384 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-01-09 08:17:22,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:17:22,386 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-01-09 08:17:22,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:22,392 INFO L225 Difference]: With dead ends: 18 [2025-01-09 08:17:22,392 INFO L226 Difference]: Without dead ends: 10 [2025-01-09 08:17:22,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:17:22,399 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:22,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:17:22,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-01-09 08:17:22,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-01-09 08:17:22,424 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-01-09 08:17:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 08:17:22,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-01-09 08:17:22,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:22,431 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 08:17:22,432 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-01-09 08:17:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 08:17:22,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 08:17:22,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:22,433 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 08:17:22,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 08:17:22,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:17:22,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:22,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2025-01-09 08:17:22,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:17:22,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [758725620] [2025-01-09 08:17:22,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:17:22,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:17:22,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:17:22,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:17:22,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 08:17:22,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 08:17:22,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 08:17:22,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:17:22,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:22,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 08:17:22,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:17:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:23,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:17:28,113 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse3 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_0~0#1_10| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_10|)))))))))))) (_ bv0 8)))) (.cse2 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_10|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_0~0#1_10|))))))))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_8~0#1|))))) (let ((.cse9 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_46~0#1|)) (.cse11 (or .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|))))))))) (.cse12 (or .cse3 (forall ((|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|))))))))) (let ((.cse7 (forall ((|ULTIMATE.start_main_~var_23~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_23~0#1|)))))))))))) (.cse10 (and .cse11 .cse12)) (.cse5 (or (and (or .cse2 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|)))))))))))))) (or .cse3 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|)))))))))))))) .cse9)) (.cse8 (forall ((|ULTIMATE.start_main_~var_23~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_23~0#1|)))))))))))) (and (or (forall ((|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)))))))))) (let ((.cse4 (or (not .cse9) .cse10))) (and (or (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse6)))))) (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|)))) |c_ULTIMATE.start_main_~var_12~0#1|))) .cse2) (or (forall ((|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|)))) |c_ULTIMATE.start_main_~var_12~0#1|)) .cse3) .cse4 .cse5)) .cse7) (or (and .cse4 .cse5) .cse8)))) (or (and (or .cse7 .cse10) (or (and .cse11 .cse12 .cse5) .cse8)) (forall ((|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|))))))))))))))))) is different from false [2025-01-09 08:17:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-01-09 08:17:31,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:17:31,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758725620] [2025-01-09 08:17:31,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758725620] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:17:31,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 08:17:31,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-09 08:17:31,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844309779] [2025-01-09 08:17:31,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 08:17:31,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:17:31,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:17:31,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:17:31,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=49, Unknown=1, NotChecked=14, Total=90 [2025-01-09 08:17:31,277 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:31,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:17:31,697 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-01-09 08:17:31,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:17:31,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 08:17:31,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:17:31,698 INFO L225 Difference]: With dead ends: 15 [2025-01-09 08:17:31,698 INFO L226 Difference]: Without dead ends: 13 [2025-01-09 08:17:31,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=42, Invalid=71, Unknown=1, NotChecked=18, Total=132 [2025-01-09 08:17:31,699 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:17:31,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 20 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 7 Unchecked, 0.2s Time] [2025-01-09 08:17:31,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-01-09 08:17:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-01-09 08:17:31,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-01-09 08:17:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-01-09 08:17:31,703 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-01-09 08:17:31,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:17:31,703 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-01-09 08:17:31,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:17:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-01-09 08:17:31,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 08:17:31,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:17:31,704 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-01-09 08:17:31,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 08:17:31,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:17:31,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:17:31,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:17:31,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2025-01-09 08:17:31,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:17:31,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [457904998] [2025-01-09 08:17:31,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 08:17:31,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:17:31,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:17:31,912 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:17:31,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 08:17:32,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-09 08:17:32,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 08:17:32,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 08:17:32,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:17:32,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 08:17:32,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:17:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:17:33,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:17:49,477 WARN L249 Executor]: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-01-09 08:17:49,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-01-09 08:17:49,479 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:17:49,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457904998] [2025-01-09 08:17:49,479 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-01-09 08:17:49,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 08:17:49,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:17:49,681 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:86) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2025-01-09 08:17:49,686 INFO L158 Benchmark]: Toolchain (without parser) took 29091.96ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 92.2MB in the beginning and 133.7MB in the end (delta: -41.4MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2025-01-09 08:17:49,686 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 83.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:17:49,686 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.26ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 72.4MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:17:49,686 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.69ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 68.9MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:17:49,688 INFO L158 Benchmark]: Boogie Preprocessor took 70.64ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 65.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:17:49,688 INFO L158 Benchmark]: RCFGBuilder took 645.51ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 81.1MB in the end (delta: -16.0MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2025-01-09 08:17:49,690 INFO L158 Benchmark]: TraceAbstraction took 27909.66ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 80.4MB in the beginning and 133.7MB in the end (delta: -53.3MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2025-01-09 08:17:49,691 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.49ms. Allocated memory is still 83.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.26ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 72.4MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.69ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 68.9MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.64ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 65.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 645.51ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 81.1MB in the end (delta: -16.0MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * TraceAbstraction took 27909.66ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 80.4MB in the beginning and 133.7MB in the end (delta: -53.3MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")