./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul6.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul6.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 5cd943ce762aff3a1020bcfbad33bdc9a1f90fe90606158db2b132c5b2ce5f40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:32:04,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:32:04,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:32:04,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:32:04,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:32:04,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:32:04,636 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:32:04,636 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:32:04,637 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:32:04,637 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:32:04,637 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:32:04,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:32:04,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:32:04,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:32:04,638 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:32:04,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:32:04,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:32:04,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:32:04,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:32:04,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:32:04,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:32:04,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:32:04,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:32:04,639 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:32:04,639 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:32:04,639 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:32:04,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:32:04,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:32:04,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:32:04,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:32:04,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:32:04,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:32:04,641 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:32:04,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:32:04,641 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:32:04,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:32:04,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:32:04,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:32:04,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:32:04,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:32:04,641 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 -> 5cd943ce762aff3a1020bcfbad33bdc9a1f90fe90606158db2b132c5b2ce5f40 [2025-02-07 23:32:04,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:32:04,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:32:04,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:32:04,860 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:32:04,860 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:32:04,861 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.mul6.c [2025-02-07 23:32:06,003 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e33359111/4fdda03e841c430e814906d4fcd11e4a/FLAG77005bac0 [2025-02-07 23:32:06,314 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:32:06,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul6.c [2025-02-07 23:32:06,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e33359111/4fdda03e841c430e814906d4fcd11e4a/FLAG77005bac0 [2025-02-07 23:32:06,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e33359111/4fdda03e841c430e814906d4fcd11e4a [2025-02-07 23:32:06,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:32:06,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:32:06,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:32:06,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:32:06,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:32:06,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:32:06" (1/1) ... [2025-02-07 23:32:06,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7973a023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:06, skipping insertion in model container [2025-02-07 23:32:06,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:32:06" (1/1) ... [2025-02-07 23:32:06,623 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:32:06,732 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.mul6.c[1298,1311] [2025-02-07 23:32:06,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:32:06,795 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:32:06,802 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.mul6.c[1298,1311] [2025-02-07 23:32:06,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:32:06,833 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:32:06,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:06 WrapperNode [2025-02-07 23:32:06,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:32:06,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:32:06,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:32:06,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:32:06,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:06" (1/1) ... [2025-02-07 23:32:06,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:06" (1/1) ... [2025-02-07 23:32:06,901 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 518 [2025-02-07 23:32:06,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:32:06,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:32:06,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:32:06,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:32:06,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:06" (1/1) ... [2025-02-07 23:32:06,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:06" (1/1) ... [2025-02-07 23:32:06,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:06" (1/1) ... [2025-02-07 23:32:06,926 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-02-07 23:32:06,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:06" (1/1) ... [2025-02-07 23:32:06,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:06" (1/1) ... [2025-02-07 23:32:06,936 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:06" (1/1) ... [2025-02-07 23:32:06,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:06" (1/1) ... [2025-02-07 23:32:06,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:06" (1/1) ... [2025-02-07 23:32:06,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:06" (1/1) ... [2025-02-07 23:32:06,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:32:06,949 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:32:06,949 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:32:06,949 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:32:06,954 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:06" (1/1) ... [2025-02-07 23:32:06,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:32:06,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:32:06,978 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 23:32:06,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 23:32:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:32:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:32:06,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 23:32:06,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:32:06,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:32:07,074 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:32:07,076 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:32:07,673 INFO L? ?]: Removed 209 outVars from TransFormulas that were not future-live. [2025-02-07 23:32:07,673 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:32:07,707 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:32:07,707 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:32:07,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:32:07 BoogieIcfgContainer [2025-02-07 23:32:07,708 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:32:07,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:32:07,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:32:07,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:32:07,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:32:06" (1/3) ... [2025-02-07 23:32:07,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311ef29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:32:07, skipping insertion in model container [2025-02-07 23:32:07,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:06" (2/3) ... [2025-02-07 23:32:07,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311ef29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:32:07, skipping insertion in model container [2025-02-07 23:32:07,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:32:07" (3/3) ... [2025-02-07 23:32:07,717 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul6.c [2025-02-07 23:32:07,728 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:32:07,729 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul6.c that has 1 procedures, 132 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:32:07,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:32:07,778 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;@1704fb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:32:07,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:32:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 130 states have (on average 1.5) internal successors, (195), 131 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:07,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-07 23:32:07,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:07,785 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] [2025-02-07 23:32:07,786 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:07,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:07,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1831889244, now seen corresponding path program 1 times [2025-02-07 23:32:07,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:07,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884989649] [2025-02-07 23:32:07,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:07,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:07,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-07 23:32:07,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-07 23:32:07,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:07,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:08,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:08,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884989649] [2025-02-07 23:32:08,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884989649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:08,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:08,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:32:08,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153691432] [2025-02-07 23:32:08,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:08,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:32:08,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:08,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:32:08,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:32:08,369 INFO L87 Difference]: Start difference. First operand has 132 states, 130 states have (on average 1.5) internal successors, (195), 131 states have internal predecessors, (195), 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 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:08,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:08,486 INFO L93 Difference]: Finished difference Result 223 states and 331 transitions. [2025-02-07 23:32:08,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:32:08,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 38 [2025-02-07 23:32:08,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:08,493 INFO L225 Difference]: With dead ends: 223 [2025-02-07 23:32:08,493 INFO L226 Difference]: Without dead ends: 132 [2025-02-07 23:32:08,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:32:08,499 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:08,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 472 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:32:08,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-07 23:32:08,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-02-07 23:32:08,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.4809160305343512) internal successors, (194), 131 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:08,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2025-02-07 23:32:08,534 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 38 [2025-02-07 23:32:08,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:08,535 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2025-02-07 23:32:08,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:08,535 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2025-02-07 23:32:08,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-07 23:32:08,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:08,537 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] [2025-02-07 23:32:08,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:32:08,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:08,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:08,538 INFO L85 PathProgramCache]: Analyzing trace with hash 958670957, now seen corresponding path program 1 times [2025-02-07 23:32:08,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:08,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840033197] [2025-02-07 23:32:08,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:08,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:08,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 23:32:08,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 23:32:08,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:08,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:08,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:08,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840033197] [2025-02-07 23:32:08,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840033197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:08,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:08,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:32:08,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802061158] [2025-02-07 23:32:08,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:08,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:32:08,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:08,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:32:08,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:32:08,696 INFO L87 Difference]: Start difference. First operand 132 states and 194 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:08,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:08,767 INFO L93 Difference]: Finished difference Result 225 states and 330 transitions. [2025-02-07 23:32:08,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:32:08,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2025-02-07 23:32:08,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:08,768 INFO L225 Difference]: With dead ends: 225 [2025-02-07 23:32:08,768 INFO L226 Difference]: Without dead ends: 134 [2025-02-07 23:32:08,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:32:08,769 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:08,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 469 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:32:08,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-07 23:32:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-02-07 23:32:08,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.4736842105263157) internal successors, (196), 133 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 196 transitions. [2025-02-07 23:32:08,774 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 196 transitions. Word has length 39 [2025-02-07 23:32:08,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:08,774 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 196 transitions. [2025-02-07 23:32:08,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 196 transitions. [2025-02-07 23:32:08,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-07 23:32:08,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:08,775 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] [2025-02-07 23:32:08,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:32:08,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:08,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:08,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1585537911, now seen corresponding path program 1 times [2025-02-07 23:32:08,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:08,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609115243] [2025-02-07 23:32:08,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:08,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:08,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-07 23:32:08,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 23:32:08,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:08,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:09,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:09,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609115243] [2025-02-07 23:32:09,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609115243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:09,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:09,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:32:09,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852841420] [2025-02-07 23:32:09,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:09,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:32:09,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:09,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:32:09,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:32:09,076 INFO L87 Difference]: Start difference. First operand 134 states and 196 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:09,194 INFO L93 Difference]: Finished difference Result 264 states and 382 transitions. [2025-02-07 23:32:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:32:09,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2025-02-07 23:32:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:09,196 INFO L225 Difference]: With dead ends: 264 [2025-02-07 23:32:09,196 INFO L226 Difference]: Without dead ends: 171 [2025-02-07 23:32:09,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:32:09,197 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 79 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:09,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 568 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:32:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-07 23:32:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 152. [2025-02-07 23:32:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.4701986754966887) internal successors, (222), 151 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 222 transitions. [2025-02-07 23:32:09,203 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 222 transitions. Word has length 40 [2025-02-07 23:32:09,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:09,203 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 222 transitions. [2025-02-07 23:32:09,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 222 transitions. [2025-02-07 23:32:09,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-07 23:32:09,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:09,204 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-02-07 23:32:09,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:32:09,205 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:09,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash -499569710, now seen corresponding path program 1 times [2025-02-07 23:32:09,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:09,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810789194] [2025-02-07 23:32:09,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:09,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:09,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-07 23:32:09,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-07 23:32:09,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:09,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:09,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:09,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:09,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810789194] [2025-02-07 23:32:09,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810789194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:09,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:09,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:32:09,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560415312] [2025-02-07 23:32:09,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:09,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:32:09,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:09,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:32:09,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:32:09,502 INFO L87 Difference]: Start difference. First operand 152 states and 222 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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-02-07 23:32:09,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:09,655 INFO L93 Difference]: Finished difference Result 266 states and 384 transitions. [2025-02-07 23:32:09,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:32:09,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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-02-07 23:32:09,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:09,656 INFO L225 Difference]: With dead ends: 266 [2025-02-07 23:32:09,656 INFO L226 Difference]: Without dead ends: 173 [2025-02-07 23:32:09,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:32:09,657 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 80 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:09,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 866 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:32:09,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-07 23:32:09,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 155. [2025-02-07 23:32:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.4675324675324675) internal successors, (226), 154 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:09,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 226 transitions. [2025-02-07 23:32:09,663 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 226 transitions. Word has length 41 [2025-02-07 23:32:09,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:09,663 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 226 transitions. [2025-02-07 23:32:09,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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-02-07 23:32:09,663 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 226 transitions. [2025-02-07 23:32:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-07 23:32:09,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:09,664 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-02-07 23:32:09,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:32:09,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:09,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:09,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1752623674, now seen corresponding path program 1 times [2025-02-07 23:32:09,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:09,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506733052] [2025-02-07 23:32:09,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:09,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:09,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-07 23:32:09,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 23:32:09,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:09,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:10,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:10,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506733052] [2025-02-07 23:32:10,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506733052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:10,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:10,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:32:10,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248082053] [2025-02-07 23:32:10,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:10,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:32:10,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:10,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:32:10,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:32:10,143 INFO L87 Difference]: Start difference. First operand 155 states and 226 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 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-02-07 23:32:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:10,341 INFO L93 Difference]: Finished difference Result 266 states and 383 transitions. [2025-02-07 23:32:10,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:32:10,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 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-02-07 23:32:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:10,342 INFO L225 Difference]: With dead ends: 266 [2025-02-07 23:32:10,342 INFO L226 Difference]: Without dead ends: 173 [2025-02-07 23:32:10,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:32:10,343 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 78 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:10,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 850 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:32:10,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-07 23:32:10,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 159. [2025-02-07 23:32:10,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.4620253164556962) internal successors, (231), 158 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 231 transitions. [2025-02-07 23:32:10,353 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 231 transitions. Word has length 42 [2025-02-07 23:32:10,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:10,353 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 231 transitions. [2025-02-07 23:32:10,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 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-02-07 23:32:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 231 transitions. [2025-02-07 23:32:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-07 23:32:10,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:10,354 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-02-07 23:32:10,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 23:32:10,354 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:10,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:10,355 INFO L85 PathProgramCache]: Analyzing trace with hash 390545928, now seen corresponding path program 1 times [2025-02-07 23:32:10,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:10,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079116567] [2025-02-07 23:32:10,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:10,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:10,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 23:32:10,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 23:32:10,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:10,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:32:10,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 23:32:10,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 23:32:10,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 23:32:10,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:10,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:32:10,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 23:32:10,424 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 23:32:10,424 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:32:10,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 23:32:10,428 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-07 23:32:10,447 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:32:10,455 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:32:10,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:32:10 BoogieIcfgContainer [2025-02-07 23:32:10,458 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:32:10,458 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:32:10,458 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:32:10,458 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:32:10,459 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:32:07" (3/4) ... [2025-02-07 23:32:10,460 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 23:32:10,461 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:32:10,461 INFO L158 Benchmark]: Toolchain (without parser) took 3870.19ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 105.4MB in the beginning and 225.9MB in the end (delta: -120.4MB). Peak memory consumption was 98.8MB. Max. memory is 16.1GB. [2025-02-07 23:32:10,461 INFO L158 Benchmark]: CDTParser took 1.30ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:32:10,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.38ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 89.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 23:32:10,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.07ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 82.0MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:32:10,462 INFO L158 Benchmark]: Boogie Preprocessor took 47.05ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 76.8MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:32:10,462 INFO L158 Benchmark]: IcfgBuilder took 758.58ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 85.5MB in the end (delta: -8.8MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2025-02-07 23:32:10,462 INFO L158 Benchmark]: TraceAbstraction took 2748.55ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 84.8MB in the beginning and 225.9MB in the end (delta: -141.2MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. [2025-02-07 23:32:10,462 INFO L158 Benchmark]: Witness Printer took 2.66ms. Allocated memory is still 360.7MB. Free memory was 225.9MB in the beginning and 225.9MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:32:10,463 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.30ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.38ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 89.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.07ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 82.0MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.05ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 76.8MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 758.58ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 85.5MB in the end (delta: -8.8MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2748.55ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 84.8MB in the beginning and 225.9MB in the end (delta: -141.2MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. * Witness Printer took 2.66ms. Allocated memory is still 360.7MB. Free memory was 225.9MB in the beginning and 225.9MB in the end (delta: 72.1kB). 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: 22]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 111, overapproximation of bitwiseAnd at line 116. Possible FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 64); [L31] const SORT_5 msb_SORT_5 = (SORT_5)1 << (64 - 1); [L33] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 10); [L34] const SORT_8 msb_SORT_8 = (SORT_8)1 << (10 - 1); [L36] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 128); [L37] const SORT_14 msb_SORT_14 = (SORT_14)1 << (128 - 1); [L39] const SORT_57 mask_SORT_57 = (SORT_57)-1 >> (sizeof(SORT_57) * 8 - 32); [L40] const SORT_57 msb_SORT_57 = (SORT_57)1 << (32 - 1); [L42] const SORT_1 var_10 = 0; [L43] const SORT_14 var_15 = 0; [L44] const SORT_1 var_24 = 1; [L45] const SORT_5 var_28 = 0; [L46] const SORT_8 var_35 = 0; [L47] const SORT_57 var_58 = 1; [L48] const SORT_57 var_62 = 1000; [L49] const SORT_5 var_64 = 9223372036854775807; [L50] const SORT_5 var_67 = 12245771; [L52] SORT_1 input_2; [L53] SORT_1 input_3; [L54] SORT_1 input_4; [L55] SORT_5 input_6; [L56] SORT_5 input_7; [L57] SORT_8 input_9; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L59] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uint128() & mask_SORT_14 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L60] SORT_14 state_16 = __VERIFIER_nondet_uint128() & mask_SORT_14; [L61] EXPR __VERIFIER_nondet_uint128() & mask_SORT_14 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L61] SORT_14 state_18 = __VERIFIER_nondet_uint128() & mask_SORT_14; [L62] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L62] SORT_5 state_29 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L63] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L63] SORT_5 state_31 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L64] EXPR __VERIFIER_nondet_ushort() & mask_SORT_8 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L64] SORT_8 state_36 = __VERIFIER_nondet_ushort() & mask_SORT_8; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L65] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L66] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L67] SORT_5 state_42 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L68] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L68] SORT_5 state_44 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L70] SORT_1 init_12_arg_1 = var_10; [L71] state_11 = init_12_arg_1 [L72] SORT_14 init_17_arg_1 = var_15; [L73] state_16 = init_17_arg_1 [L74] SORT_14 init_19_arg_1 = var_15; [L75] state_18 = init_19_arg_1 [L76] SORT_5 init_30_arg_1 = var_28; [L77] state_29 = init_30_arg_1 [L78] SORT_5 init_32_arg_1 = var_28; [L79] state_31 = init_32_arg_1 [L80] SORT_8 init_37_arg_1 = var_35; [L81] state_36 = init_37_arg_1 [L82] SORT_1 init_39_arg_1 = var_24; [L83] state_38 = init_39_arg_1 [L84] SORT_1 init_41_arg_1 = var_24; [L85] state_40 = init_41_arg_1 [L86] SORT_5 init_43_arg_1 = var_28; [L87] state_42 = init_43_arg_1 [L88] SORT_5 init_45_arg_1 = var_28; [L89] state_44 = init_45_arg_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] EXPR input_4 & mask_SORT_1 VAL [input_3=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] EXPR input_6 & mask_SORT_5 VAL [input_3=0, input_4=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] EXPR input_7 & mask_SORT_5 VAL [input_3=0, input_4=0, input_6=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_21_arg_0=-1, var_21_arg_1=1, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L111] EXPR var_21_arg_0 | var_21_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_26_arg_0=1, var_26_arg_1=-1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L116] EXPR var_26_arg_0 & var_26_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] EXPR var_26 & mask_SORT_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 132 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 237 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 237 mSDsluCounter, 3225 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2447 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 815 IncrementalHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 778 mSDtfsCounter, 815 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=5, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-07 23:32:10,482 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.mul6.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 5cd943ce762aff3a1020bcfbad33bdc9a1f90fe90606158db2b132c5b2ce5f40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:32:12,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:32:12,673 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 23:32:12,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:32:12,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:32:12,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:32:12,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:32:12,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:32:12,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:32:12,706 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:32:12,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:32:12,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:32:12,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:32:12,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:32:12,706 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:32:12,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:32:12,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:32:12,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:32:12,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:32:12,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:32:12,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:32:12,707 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 23:32:12,707 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 23:32:12,707 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 23:32:12,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:32:12,707 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:32:12,707 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:32:12,707 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:32:12,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:32:12,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:32:12,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:32:12,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:32:12,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:32:12,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:32:12,708 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:32:12,708 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:32:12,708 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 23:32:12,708 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 23:32:12,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:32:12,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:32:12,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:32:12,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:32:12,708 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 -> 5cd943ce762aff3a1020bcfbad33bdc9a1f90fe90606158db2b132c5b2ce5f40 [2025-02-07 23:32:12,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:32:12,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:32:12,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:32:12,969 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:32:12,969 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:32:12,970 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.mul6.c [2025-02-07 23:32:14,193 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72683321a/04f0a1ad8c4f42feba81f65c804efece/FLAGd5f0375e3 [2025-02-07 23:32:14,392 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:32:14,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul6.c [2025-02-07 23:32:14,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72683321a/04f0a1ad8c4f42feba81f65c804efece/FLAGd5f0375e3 [2025-02-07 23:32:14,779 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72683321a/04f0a1ad8c4f42feba81f65c804efece [2025-02-07 23:32:14,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:32:14,782 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:32:14,783 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:32:14,783 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:32:14,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:32:14,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:32:14" (1/1) ... [2025-02-07 23:32:14,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7640dea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:14, skipping insertion in model container [2025-02-07 23:32:14,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:32:14" (1/1) ... [2025-02-07 23:32:14,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:32:14,893 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.mul6.c[1298,1311] [2025-02-07 23:32:14,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:32:14,956 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:32:14,964 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.mul6.c[1298,1311] [2025-02-07 23:32:14,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:32:14,998 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:32:14,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:14 WrapperNode [2025-02-07 23:32:14,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:32:15,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:32:15,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:32:15,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:32:15,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:14" (1/1) ... [2025-02-07 23:32:15,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:14" (1/1) ... [2025-02-07 23:32:15,034 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 270 [2025-02-07 23:32:15,035 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:32:15,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:32:15,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:32:15,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:32:15,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:14" (1/1) ... [2025-02-07 23:32:15,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:14" (1/1) ... [2025-02-07 23:32:15,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:14" (1/1) ... [2025-02-07 23:32:15,052 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-02-07 23:32:15,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:14" (1/1) ... [2025-02-07 23:32:15,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:14" (1/1) ... [2025-02-07 23:32:15,057 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:14" (1/1) ... [2025-02-07 23:32:15,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:14" (1/1) ... [2025-02-07 23:32:15,059 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:14" (1/1) ... [2025-02-07 23:32:15,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:14" (1/1) ... [2025-02-07 23:32:15,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:32:15,062 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:32:15,062 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:32:15,062 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:32:15,063 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:14" (1/1) ... [2025-02-07 23:32:15,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:32:15,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:32:15,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 23:32:15,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 23:32:15,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:32:15,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 23:32:15,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-07 23:32:15,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:32:15,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:32:15,198 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:32:15,199 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:32:15,648 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-02-07 23:32:15,648 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:32:15,655 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:32:15,655 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:32:15,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:32:15 BoogieIcfgContainer [2025-02-07 23:32:15,655 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:32:15,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:32:15,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:32:15,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:32:15,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:32:14" (1/3) ... [2025-02-07 23:32:15,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4621fc50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:32:15, skipping insertion in model container [2025-02-07 23:32:15,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:14" (2/3) ... [2025-02-07 23:32:15,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4621fc50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:32:15, skipping insertion in model container [2025-02-07 23:32:15,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:32:15" (3/3) ... [2025-02-07 23:32:15,663 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul6.c [2025-02-07 23:32:15,673 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:32:15,674 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul6.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:32:15,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:32:15,715 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;@48a9a20f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:32:15,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:32:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:15,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 23:32:15,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:15,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 23:32:15,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:15,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:15,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 23:32:15,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:32:15,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1134921851] [2025-02-07 23:32:15,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:15,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:32:15,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:32:15,735 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:32:15,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 23:32:15,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 23:32:15,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 23:32:15,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:15,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:15,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-07 23:32:15,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:32:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:16,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:32:16,043 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:32:16,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134921851] [2025-02-07 23:32:16,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134921851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:16,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:16,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:32:16,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600187410] [2025-02-07 23:32:16,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:16,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:32:16,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:32:16,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:32:16,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:32:16,060 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:17,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 23:32:17,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:17,448 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-07 23:32:17,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:32:17,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-07 23:32:17,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:17,453 INFO L225 Difference]: With dead ends: 16 [2025-02-07 23:32:17,453 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 23:32:17,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:32:17,456 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:17,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-07 23:32:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 23:32:17,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-07 23:32:17,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 23:32:17,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 23:32:17,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:17,474 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 23:32:17,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 23:32:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 23:32:17,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:17,475 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 23:32:17,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 23:32:17,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:32:17,679 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:17,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:17,681 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 23:32:17,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:32:17,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [620343679] [2025-02-07 23:32:17,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:17,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:32:17,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:32:17,684 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:32:17,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 23:32:17,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 23:32:17,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 23:32:17,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:17,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:17,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-07 23:32:17,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:32:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:18,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:33:04,379 WARN L286 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-07 23:33:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:33:06,256 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:33:06,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620343679] [2025-02-07 23:33:06,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620343679] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:33:06,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 23:33:06,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2025-02-07 23:33:06,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591192028] [2025-02-07 23:33:06,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 23:33:06,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 23:33:06,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:33:06,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 23:33:06,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:33:06,263 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:33:07,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 23:33:09,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-02-07 23:33:10,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-02-07 23:33:12,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-02-07 23:33:13,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 23:33:14,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:33:14,890 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-02-07 23:33:14,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:33:14,925 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 23:33:14,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:33:14,926 INFO L225 Difference]: With dead ends: 13 [2025-02-07 23:33:14,926 INFO L226 Difference]: Without dead ends: 11 [2025-02-07 23:33:14,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:33:14,928 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:33:14,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2025-02-07 23:33:14,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-07 23:33:14,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-07 23:33:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:33:14,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-07 23:33:14,932 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-07 23:33:14,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:33:14,932 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-07 23:33:14,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:33:14,932 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-07 23:33:14,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 23:33:14,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:33:14,932 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-02-07 23:33:14,954 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-02-07 23:33:15,133 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-02-07 23:33:15,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:33:15,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:33:15,134 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-02-07 23:33:15,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:33:15,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [369533694] [2025-02-07 23:33:15,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 23:33:15,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:33:15,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:33:15,136 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-02-07 23:33:15,137 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-02-07 23:33:15,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-07 23:33:15,572 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 23:33:15,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 23:33:15,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:33:15,572 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 23:33:15,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 23:33:15,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 23:33:15,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:33:15,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:33:16,040 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-07 23:33:16,040 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 23:33:16,041 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:33:16,085 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-02-07 23:33:16,242 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-02-07 23:33:16,245 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1] [2025-02-07 23:33:16,268 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:33:16,268 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:33:16,268 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:33:16,278 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:33:16,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:33:16 BoogieIcfgContainer [2025-02-07 23:33:16,284 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:33:16,285 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:33:16,285 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:33:16,285 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:33:16,286 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:32:15" (3/4) ... [2025-02-07 23:33:16,286 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 23:33:16,309 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:33:16,309 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:33:16,309 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:33:16,368 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-02-07 23:33:16,402 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 23:33:16,403 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 23:33:16,403 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:33:16,404 INFO L158 Benchmark]: Toolchain (without parser) took 61621.85ms. Allocated memory was 83.9MB in the beginning and 243.3MB in the end (delta: 159.4MB). Free memory was 59.4MB in the beginning and 205.3MB in the end (delta: -145.9MB). Peak memory consumption was 141.0MB. Max. memory is 16.1GB. [2025-02-07 23:33:16,405 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:33:16,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.89ms. Allocated memory is still 83.9MB. Free memory was 59.4MB in the beginning and 42.8MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 23:33:16,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.10ms. Allocated memory is still 83.9MB. Free memory was 42.8MB in the beginning and 40.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:33:16,407 INFO L158 Benchmark]: Boogie Preprocessor took 26.18ms. Allocated memory is still 83.9MB. Free memory was 40.3MB in the beginning and 37.6MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:33:16,407 INFO L158 Benchmark]: IcfgBuilder took 593.41ms. Allocated memory is still 83.9MB. Free memory was 37.6MB in the beginning and 48.7MB in the end (delta: -11.1MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2025-02-07 23:33:16,407 INFO L158 Benchmark]: TraceAbstraction took 60626.47ms. Allocated memory was 83.9MB in the beginning and 243.3MB in the end (delta: 159.4MB). Free memory was 48.2MB in the beginning and 81.5MB in the end (delta: -33.3MB). Peak memory consumption was 119.8MB. Max. memory is 16.1GB. [2025-02-07 23:33:16,407 INFO L158 Benchmark]: Witness Printer took 118.08ms. Allocated memory is still 243.3MB. Free memory was 81.5MB in the beginning and 205.3MB in the end (delta: -123.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:33:16,408 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.22ms. Allocated memory is still 83.9MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.89ms. Allocated memory is still 83.9MB. Free memory was 59.4MB in the beginning and 42.8MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.10ms. Allocated memory is still 83.9MB. Free memory was 42.8MB in the beginning and 40.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.18ms. Allocated memory is still 83.9MB. Free memory was 40.3MB in the beginning and 37.6MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 593.41ms. Allocated memory is still 83.9MB. Free memory was 37.6MB in the beginning and 48.7MB in the end (delta: -11.1MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * TraceAbstraction took 60626.47ms. Allocated memory was 83.9MB in the beginning and 243.3MB in the end (delta: 159.4MB). Free memory was 48.2MB in the beginning and 81.5MB in the end (delta: -33.3MB). Peak memory consumption was 119.8MB. Max. memory is 16.1GB. * Witness Printer took 118.08ms. Allocated memory is still 243.3MB. Free memory was 81.5MB in the beginning and 205.3MB in the end (delta: -123.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 22]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 64); [L31] const SORT_5 msb_SORT_5 = (SORT_5)1 << (64 - 1); [L33] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 10); [L34] const SORT_8 msb_SORT_8 = (SORT_8)1 << (10 - 1); [L36] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 128); [L37] const SORT_14 msb_SORT_14 = (SORT_14)1 << (128 - 1); [L39] const SORT_57 mask_SORT_57 = (SORT_57)-1 >> (sizeof(SORT_57) * 8 - 32); [L40] const SORT_57 msb_SORT_57 = (SORT_57)1 << (32 - 1); [L42] const SORT_1 var_10 = 0; [L43] const SORT_14 var_15 = 0; [L44] const SORT_1 var_24 = 1; [L45] const SORT_5 var_28 = 0; [L46] const SORT_8 var_35 = 0; [L47] const SORT_57 var_58 = 1; [L48] const SORT_57 var_62 = 1000; [L49] const SORT_5 var_64 = 9223372036854775807; [L50] const SORT_5 var_67 = 12245771; [L52] SORT_1 input_2; [L53] SORT_1 input_3; [L54] SORT_1 input_4; [L55] SORT_5 input_6; [L56] SORT_5 input_7; [L57] SORT_8 input_9; [L59] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] SORT_14 state_16 = __VERIFIER_nondet_uint128() & mask_SORT_14; [L61] SORT_14 state_18 = __VERIFIER_nondet_uint128() & mask_SORT_14; [L62] SORT_5 state_29 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L63] SORT_5 state_31 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L64] SORT_8 state_36 = __VERIFIER_nondet_ushort() & mask_SORT_8; [L65] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] SORT_5 state_42 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L68] SORT_5 state_44 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L70] SORT_1 init_12_arg_1 = var_10; [L71] state_11 = init_12_arg_1 [L72] SORT_14 init_17_arg_1 = var_15; [L73] state_16 = init_17_arg_1 [L74] SORT_14 init_19_arg_1 = var_15; [L75] state_18 = init_19_arg_1 [L76] SORT_5 init_30_arg_1 = var_28; [L77] state_29 = init_30_arg_1 [L78] SORT_5 init_32_arg_1 = var_28; [L79] state_31 = init_32_arg_1 [L80] SORT_8 init_37_arg_1 = var_35; [L81] state_36 = init_37_arg_1 [L82] SORT_1 init_39_arg_1 = var_24; [L83] state_38 = init_39_arg_1 [L84] SORT_1 init_41_arg_1 = var_24; [L85] state_40 = init_41_arg_1 [L86] SORT_5 init_43_arg_1 = var_28; [L87] state_42 = init_43_arg_1 [L88] SORT_5 init_45_arg_1 = var_28; [L89] state_44 = init_45_arg_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L22] COND FALSE !(!(cond)) [L119] RET __VERIFIER_assert(!(bad_27_arg_0)) [L121] SORT_1 next_51_arg_1 = var_24; [L122] SORT_1 var_33_arg_0 = state_11; [L123] SORT_1 var_33 = ~var_33_arg_0; [L124] var_33 = var_33 & mask_SORT_1 [L125] SORT_5 var_52_arg_0 = state_29; [L126] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L127] SORT_14 var_52 = var_52_arg_0; [L128] SORT_5 var_53_arg_0 = state_31; [L129] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L130] SORT_14 var_53 = var_53_arg_0; [L131] SORT_14 var_54_arg_0 = var_52; [L132] SORT_14 var_54_arg_1 = var_53; [L133] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L134] SORT_1 var_55_arg_0 = var_33; [L135] SORT_14 var_55_arg_1 = var_15; [L136] SORT_14 var_55_arg_2 = var_54; [L137] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L138] var_55 = var_55 & mask_SORT_14 [L139] SORT_14 next_56_arg_1 = var_55; [L140] SORT_1 var_71_arg_0 = state_38; [L141] SORT_1 var_71_arg_1 = state_40; [L142] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L143] var_71 = var_71 & mask_SORT_1 [L144] SORT_8 var_61_arg_0 = state_36; [L145] var_61_arg_0 = var_61_arg_0 & mask_SORT_8 [L146] SORT_57 var_61 = var_61_arg_0; [L147] SORT_57 var_63_arg_0 = var_61; [L148] SORT_57 var_63_arg_1 = var_62; [L149] SORT_1 var_63 = var_63_arg_0 > var_63_arg_1; [L150] SORT_5 var_65_arg_0 = input_6; [L151] SORT_5 var_65_arg_1 = var_64; [L152] SORT_1 var_65 = var_65_arg_0 == var_65_arg_1; [L153] SORT_1 var_66_arg_0 = var_63; [L154] SORT_1 var_66_arg_1 = var_65; [L155] SORT_1 var_66 = var_66_arg_0 & var_66_arg_1; [L156] SORT_5 var_68_arg_0 = input_7; [L157] SORT_5 var_68_arg_1 = var_67; [L158] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L159] SORT_1 var_69_arg_0 = var_66; [L160] SORT_1 var_69_arg_1 = var_68; [L161] SORT_1 var_69 = var_69_arg_0 & var_69_arg_1; [L162] var_69 = var_69 & mask_SORT_1 [L163] SORT_5 var_46_arg_0 = state_42; [L164] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L165] SORT_14 var_46 = var_46_arg_0; [L166] SORT_5 var_47_arg_0 = state_44; [L167] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L168] SORT_14 var_47 = var_47_arg_0; [L169] SORT_14 var_48_arg_0 = var_46; [L170] SORT_14 var_48_arg_1 = var_47; [L171] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L172] SORT_57 var_59_arg_0 = var_58; [L173] var_59_arg_0 = var_59_arg_0 & mask_SORT_57 [L174] SORT_14 var_59 = var_59_arg_0; [L175] SORT_14 var_60_arg_0 = var_48; [L176] SORT_14 var_60_arg_1 = var_59; [L177] SORT_14 var_60 = var_60_arg_0 + var_60_arg_1; [L178] SORT_1 var_70_arg_0 = var_69; [L179] SORT_14 var_70_arg_1 = var_60; [L180] SORT_14 var_70_arg_2 = var_48; [L181] SORT_14 var_70 = var_70_arg_0 ? var_70_arg_1 : var_70_arg_2; [L182] SORT_1 var_72_arg_0 = var_71; [L183] SORT_14 var_72_arg_1 = var_70; [L184] SORT_14 var_72_arg_2 = state_18; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] SORT_1 var_73_arg_0 = var_33; [L187] SORT_14 var_73_arg_1 = var_15; [L188] SORT_14 var_73_arg_2 = var_72; [L189] SORT_14 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L190] var_73 = var_73 & mask_SORT_14 [L191] SORT_14 next_74_arg_1 = var_73; [L192] SORT_1 var_75_arg_0 = input_3; [L193] SORT_5 var_75_arg_1 = input_6; [L194] SORT_5 var_75_arg_2 = state_29; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_1 var_76_arg_0 = var_33; [L197] SORT_5 var_76_arg_1 = var_28; [L198] SORT_5 var_76_arg_2 = var_75; [L199] SORT_5 var_76 = var_76_arg_0 ? var_76_arg_1 : var_76_arg_2; [L200] SORT_5 next_77_arg_1 = var_76; [L201] SORT_1 var_78_arg_0 = input_4; [L202] SORT_5 var_78_arg_1 = input_7; [L203] SORT_5 var_78_arg_2 = state_31; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_1 var_79_arg_0 = var_33; [L206] SORT_5 var_79_arg_1 = var_28; [L207] SORT_5 var_79_arg_2 = var_78; [L208] SORT_5 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L209] SORT_5 next_80_arg_1 = var_79; [L210] SORT_1 var_81_arg_0 = var_33; [L211] SORT_8 var_81_arg_1 = input_9; [L212] SORT_8 var_81_arg_2 = state_36; [L213] SORT_8 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L214] SORT_8 next_82_arg_1 = var_81; [L215] SORT_1 var_83_arg_0 = var_33; [L216] SORT_1 var_83_arg_1 = var_24; [L217] SORT_1 var_83_arg_2 = input_3; [L218] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L219] SORT_1 next_84_arg_1 = var_83; [L220] SORT_1 var_85_arg_0 = var_33; [L221] SORT_1 var_85_arg_1 = var_24; [L222] SORT_1 var_85_arg_2 = input_4; [L223] SORT_1 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L224] SORT_1 next_86_arg_1 = var_85; [L225] SORT_1 var_87_arg_0 = input_3; [L226] SORT_5 var_87_arg_1 = input_6; [L227] SORT_5 var_87_arg_2 = state_42; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_1 var_88_arg_0 = var_33; [L230] SORT_5 var_88_arg_1 = var_28; [L231] SORT_5 var_88_arg_2 = var_87; [L232] SORT_5 var_88 = var_88_arg_0 ? var_88_arg_1 : var_88_arg_2; [L233] SORT_5 next_89_arg_1 = var_88; [L234] SORT_1 var_90_arg_0 = input_4; [L235] SORT_5 var_90_arg_1 = input_7; [L236] SORT_5 var_90_arg_2 = state_44; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_1 var_91_arg_0 = var_33; [L239] SORT_5 var_91_arg_1 = var_28; [L240] SORT_5 var_91_arg_2 = var_90; [L241] SORT_5 var_91 = var_91_arg_0 ? var_91_arg_1 : var_91_arg_2; [L242] SORT_5 next_92_arg_1 = var_91; [L244] state_11 = next_51_arg_1 [L245] state_16 = next_56_arg_1 [L246] state_18 = next_74_arg_1 [L247] state_29 = next_77_arg_1 [L248] state_31 = next_80_arg_1 [L249] state_36 = next_82_arg_1 [L250] state_38 = next_84_arg_1 [L251] state_40 = next_86_arg_1 [L252] state_42 = next_89_arg_1 [L253] state_44 = next_92_arg_1 [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L22] COND FALSE !(!(cond)) [L119] RET __VERIFIER_assert(!(bad_27_arg_0)) [L121] SORT_1 next_51_arg_1 = var_24; [L122] SORT_1 var_33_arg_0 = state_11; [L123] SORT_1 var_33 = ~var_33_arg_0; [L124] var_33 = var_33 & mask_SORT_1 [L125] SORT_5 var_52_arg_0 = state_29; [L126] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L127] SORT_14 var_52 = var_52_arg_0; [L128] SORT_5 var_53_arg_0 = state_31; [L129] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L130] SORT_14 var_53 = var_53_arg_0; [L131] SORT_14 var_54_arg_0 = var_52; [L132] SORT_14 var_54_arg_1 = var_53; [L133] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L134] SORT_1 var_55_arg_0 = var_33; [L135] SORT_14 var_55_arg_1 = var_15; [L136] SORT_14 var_55_arg_2 = var_54; [L137] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L138] var_55 = var_55 & mask_SORT_14 [L139] SORT_14 next_56_arg_1 = var_55; [L140] SORT_1 var_71_arg_0 = state_38; [L141] SORT_1 var_71_arg_1 = state_40; [L142] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L143] var_71 = var_71 & mask_SORT_1 [L144] SORT_8 var_61_arg_0 = state_36; [L145] var_61_arg_0 = var_61_arg_0 & mask_SORT_8 [L146] SORT_57 var_61 = var_61_arg_0; [L147] SORT_57 var_63_arg_0 = var_61; [L148] SORT_57 var_63_arg_1 = var_62; [L149] SORT_1 var_63 = var_63_arg_0 > var_63_arg_1; [L150] SORT_5 var_65_arg_0 = input_6; [L151] SORT_5 var_65_arg_1 = var_64; [L152] SORT_1 var_65 = var_65_arg_0 == var_65_arg_1; [L153] SORT_1 var_66_arg_0 = var_63; [L154] SORT_1 var_66_arg_1 = var_65; [L155] SORT_1 var_66 = var_66_arg_0 & var_66_arg_1; [L156] SORT_5 var_68_arg_0 = input_7; [L157] SORT_5 var_68_arg_1 = var_67; [L158] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L159] SORT_1 var_69_arg_0 = var_66; [L160] SORT_1 var_69_arg_1 = var_68; [L161] SORT_1 var_69 = var_69_arg_0 & var_69_arg_1; [L162] var_69 = var_69 & mask_SORT_1 [L163] SORT_5 var_46_arg_0 = state_42; [L164] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L165] SORT_14 var_46 = var_46_arg_0; [L166] SORT_5 var_47_arg_0 = state_44; [L167] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L168] SORT_14 var_47 = var_47_arg_0; [L169] SORT_14 var_48_arg_0 = var_46; [L170] SORT_14 var_48_arg_1 = var_47; [L171] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L172] SORT_57 var_59_arg_0 = var_58; [L173] var_59_arg_0 = var_59_arg_0 & mask_SORT_57 [L174] SORT_14 var_59 = var_59_arg_0; [L175] SORT_14 var_60_arg_0 = var_48; [L176] SORT_14 var_60_arg_1 = var_59; [L177] SORT_14 var_60 = var_60_arg_0 + var_60_arg_1; [L178] SORT_1 var_70_arg_0 = var_69; [L179] SORT_14 var_70_arg_1 = var_60; [L180] SORT_14 var_70_arg_2 = var_48; [L181] SORT_14 var_70 = var_70_arg_0 ? var_70_arg_1 : var_70_arg_2; [L182] SORT_1 var_72_arg_0 = var_71; [L183] SORT_14 var_72_arg_1 = var_70; [L184] SORT_14 var_72_arg_2 = state_18; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] SORT_1 var_73_arg_0 = var_33; [L187] SORT_14 var_73_arg_1 = var_15; [L188] SORT_14 var_73_arg_2 = var_72; [L189] SORT_14 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L190] var_73 = var_73 & mask_SORT_14 [L191] SORT_14 next_74_arg_1 = var_73; [L192] SORT_1 var_75_arg_0 = input_3; [L193] SORT_5 var_75_arg_1 = input_6; [L194] SORT_5 var_75_arg_2 = state_29; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_1 var_76_arg_0 = var_33; [L197] SORT_5 var_76_arg_1 = var_28; [L198] SORT_5 var_76_arg_2 = var_75; [L199] SORT_5 var_76 = var_76_arg_0 ? var_76_arg_1 : var_76_arg_2; [L200] SORT_5 next_77_arg_1 = var_76; [L201] SORT_1 var_78_arg_0 = input_4; [L202] SORT_5 var_78_arg_1 = input_7; [L203] SORT_5 var_78_arg_2 = state_31; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_1 var_79_arg_0 = var_33; [L206] SORT_5 var_79_arg_1 = var_28; [L207] SORT_5 var_79_arg_2 = var_78; [L208] SORT_5 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L209] SORT_5 next_80_arg_1 = var_79; [L210] SORT_1 var_81_arg_0 = var_33; [L211] SORT_8 var_81_arg_1 = input_9; [L212] SORT_8 var_81_arg_2 = state_36; [L213] SORT_8 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L214] SORT_8 next_82_arg_1 = var_81; [L215] SORT_1 var_83_arg_0 = var_33; [L216] SORT_1 var_83_arg_1 = var_24; [L217] SORT_1 var_83_arg_2 = input_3; [L218] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L219] SORT_1 next_84_arg_1 = var_83; [L220] SORT_1 var_85_arg_0 = var_33; [L221] SORT_1 var_85_arg_1 = var_24; [L222] SORT_1 var_85_arg_2 = input_4; [L223] SORT_1 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L224] SORT_1 next_86_arg_1 = var_85; [L225] SORT_1 var_87_arg_0 = input_3; [L226] SORT_5 var_87_arg_1 = input_6; [L227] SORT_5 var_87_arg_2 = state_42; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_1 var_88_arg_0 = var_33; [L230] SORT_5 var_88_arg_1 = var_28; [L231] SORT_5 var_88_arg_2 = var_87; [L232] SORT_5 var_88 = var_88_arg_0 ? var_88_arg_1 : var_88_arg_2; [L233] SORT_5 next_89_arg_1 = var_88; [L234] SORT_1 var_90_arg_0 = input_4; [L235] SORT_5 var_90_arg_1 = input_7; [L236] SORT_5 var_90_arg_2 = state_44; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_1 var_91_arg_0 = var_33; [L239] SORT_5 var_91_arg_1 = var_28; [L240] SORT_5 var_91_arg_2 = var_90; [L241] SORT_5 var_91 = var_91_arg_0 ? var_91_arg_1 : var_91_arg_2; [L242] SORT_5 next_92_arg_1 = var_91; [L244] state_11 = next_51_arg_1 [L245] state_16 = next_56_arg_1 [L246] state_18 = next_74_arg_1 [L247] state_29 = next_77_arg_1 [L248] state_31 = next_80_arg_1 [L249] state_36 = next_82_arg_1 [L250] state_38 = next_84_arg_1 [L251] state_40 = next_86_arg_1 [L252] state_42 = next_89_arg_1 [L253] state_44 = next_92_arg_1 [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.5s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 6 mSDtfsCounter, 38 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 19.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 48.6s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 4 QuantifiedInterpolants, 876 SizeOfPredicates, 24 NumberOfNonLiveVariables, 191 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/4 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 proved your program to be incorrect! [2025-02-07 23:33:16,477 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE