./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/jain_5-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/jain_5-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 51f18e80b5b0f6da04af12e6407c1afb08dc9b5e98545aeafa4f330f4ac3434e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:43:24,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:43:24,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:43:24,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:43:24,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:43:24,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:43:24,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:43:24,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:43:24,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:43:24,914 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:43:24,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:43:24,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:43:24,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:43:24,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:43:24,916 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:43:24,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:43:24,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:43:24,916 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:43:24,916 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:43:24,916 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:43:24,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:43:24,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:43:24,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:43:24,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:43:24,917 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:43:24,917 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:43:24,917 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:43:24,917 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:43:24,917 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:43:24,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:43:24,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:43:24,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:43:24,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:43:24,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:43:24,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:43:24,918 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:43:24,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:43:24,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:43:24,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:43:24,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:43:24,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:43:24,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:43:24,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:43:24,919 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 51f18e80b5b0f6da04af12e6407c1afb08dc9b5e98545aeafa4f330f4ac3434e [2025-03-03 09:43:25,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:43:25,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:43:25,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:43:25,160 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:43:25,161 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:43:25,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/jain_5-2.c [2025-03-03 09:43:26,316 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c0e9a87c/ba05245e35624110bd6b8af44ebebc4d/FLAGf5f12623a [2025-03-03 09:43:26,540 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:43:26,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/jain_5-2.c [2025-03-03 09:43:26,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c0e9a87c/ba05245e35624110bd6b8af44ebebc4d/FLAGf5f12623a [2025-03-03 09:43:26,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c0e9a87c/ba05245e35624110bd6b8af44ebebc4d [2025-03-03 09:43:26,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:43:26,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:43:26,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:43:26,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:43:26,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:43:26,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:43:26" (1/1) ... [2025-03-03 09:43:26,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@570830d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26, skipping insertion in model container [2025-03-03 09:43:26,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:43:26" (1/1) ... [2025-03-03 09:43:26,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:43:26,676 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/jain_5-2.c[665,678] [2025-03-03 09:43:26,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:43:26,692 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:43:26,699 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/jain_5-2.c[665,678] [2025-03-03 09:43:26,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:43:26,711 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:43:26,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26 WrapperNode [2025-03-03 09:43:26,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:43:26,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:43:26,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:43:26,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:43:26,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 09:43:26,722 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 09:43:26,732 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 25 [2025-03-03 09:43:26,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:43:26,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:43:26,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:43:26,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:43:26,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 09:43:26,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 09:43:26,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 09:43:26,746 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 09:43:26,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 09:43:26,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 09:43:26,749 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 09:43:26,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 09:43:26,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 09:43:26,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 09:43:26,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:43:26,755 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:43:26,755 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:43:26,755 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:43:26,755 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (1/1) ... [2025-03-03 09:43:26,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:43:26,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:26,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:43:26,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:43:26,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:43:26,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:43:26,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:43:26,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:43:26,830 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:43:26,831 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:43:26,897 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-03-03 09:43:26,897 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:43:26,902 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:43:26,902 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:43:26,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:26 BoogieIcfgContainer [2025-03-03 09:43:26,903 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:43:26,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:43:26,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:43:26,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:43:26,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:43:26" (1/3) ... [2025-03-03 09:43:26,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1923f0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:43:26, skipping insertion in model container [2025-03-03 09:43:26,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:26" (2/3) ... [2025-03-03 09:43:26,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1923f0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:43:26, skipping insertion in model container [2025-03-03 09:43:26,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:26" (3/3) ... [2025-03-03 09:43:26,909 INFO L128 eAbstractionObserver]: Analyzing ICFG jain_5-2.c [2025-03-03 09:43:26,918 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:43:26,921 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG jain_5-2.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:43:26,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:43:26,962 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;@3767cece, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:43:26,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:43:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 09:43:26,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:26,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 09:43:26,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:26,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:26,973 INFO L85 PathProgramCache]: Analyzing trace with hash 39094664, now seen corresponding path program 1 times [2025-03-03 09:43:26,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:26,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234569453] [2025-03-03 09:43:26,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:26,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:27,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 09:43:27,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 09:43:27,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:27,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:27,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:27,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234569453] [2025-03-03 09:43:27,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234569453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:27,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:27,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:43:27,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16881294] [2025-03-03 09:43:27,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:27,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:43:27,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:27,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:43:27,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:43:27,235 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:27,260 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-03-03 09:43:27,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:43:27,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 09:43:27,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:27,268 INFO L225 Difference]: With dead ends: 17 [2025-03-03 09:43:27,268 INFO L226 Difference]: Without dead ends: 9 [2025-03-03 09:43:27,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:43:27,272 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:27,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:43:27,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-03 09:43:27,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-03 09:43:27,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 09:43:27,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 09:43:27,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:27,297 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 09:43:27,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:27,297 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 09:43:27,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 09:43:27,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:27,297 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:27,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:43:27,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:27,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:27,299 INFO L85 PathProgramCache]: Analyzing trace with hash 733841028, now seen corresponding path program 1 times [2025-03-03 09:43:27,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:27,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128715123] [2025-03-03 09:43:27,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:27,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:27,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 09:43:27,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 09:43:27,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:27,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:27,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:27,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128715123] [2025-03-03 09:43:27,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128715123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:27,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065535372] [2025-03-03 09:43:27,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:27,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:27,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:27,460 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:27,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:43:27,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 09:43:27,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 09:43:27,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:27,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:27,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 09:43:27,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:27,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:27,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065535372] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:43:27,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:43:27,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-03 09:43:27,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118512741] [2025-03-03 09:43:27,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:43:27,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:43:27,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:27,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:43:27,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:43:27,655 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:27,736 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2025-03-03 09:43:27,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:43:27,736 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 09:43:27,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:27,736 INFO L225 Difference]: With dead ends: 20 [2025-03-03 09:43:27,736 INFO L226 Difference]: Without dead ends: 18 [2025-03-03 09:43:27,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:43:27,737 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:27,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 24 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:43:27,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-03 09:43:27,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-03 09:43:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-03-03 09:43:27,743 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2025-03-03 09:43:27,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:27,744 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-03-03 09:43:27,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:27,744 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-03-03 09:43:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:43:27,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:27,745 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2025-03-03 09:43:27,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 09:43:27,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:27,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:27,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:27,946 INFO L85 PathProgramCache]: Analyzing trace with hash -68041080, now seen corresponding path program 2 times [2025-03-03 09:43:27,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:27,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281838750] [2025-03-03 09:43:27,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:43:27,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:27,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-03 09:43:27,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:43:27,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:43:27,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:28,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:28,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281838750] [2025-03-03 09:43:28,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281838750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:28,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600495146] [2025-03-03 09:43:28,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:43:28,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:28,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:28,190 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:28,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:43:28,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-03 09:43:28,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:43:28,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:43:28,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:28,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 09:43:28,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:28,355 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:28,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:28,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600495146] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:43:28,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:43:28,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2025-03-03 09:43:28,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318791549] [2025-03-03 09:43:28,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:43:28,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 09:43:28,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:28,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 09:43:28,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:43:28,598 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:31,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:31,018 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-03 09:43:31,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 09:43:31,019 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-03 09:43:31,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:31,019 INFO L225 Difference]: With dead ends: 38 [2025-03-03 09:43:31,020 INFO L226 Difference]: Without dead ends: 36 [2025-03-03 09:43:31,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2025-03-03 09:43:31,021 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:31,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:31,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-03 09:43:31,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-03 09:43:31,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2025-03-03 09:43:31,028 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 17 [2025-03-03 09:43:31,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:31,028 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2025-03-03 09:43:31,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:31,029 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2025-03-03 09:43:31,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 09:43:31,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:31,031 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2025-03-03 09:43:31,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:43:31,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 09:43:31,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:31,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:31,235 INFO L85 PathProgramCache]: Analyzing trace with hash -839314936, now seen corresponding path program 3 times [2025-03-03 09:43:31,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:31,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130820906] [2025-03-03 09:43:31,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:43:31,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:31,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 11 equivalence classes. [2025-03-03 09:43:31,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:43:31,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-03 09:43:31,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:31,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:31,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130820906] [2025-03-03 09:43:31,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130820906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:31,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515202363] [2025-03-03 09:43:31,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:43:31,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:31,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:31,713 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:31,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:43:31,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 11 equivalence classes. [2025-03-03 09:43:32,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:43:32,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-03 09:43:32,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:32,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-03 09:43:32,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:32,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:38,335 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:38,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515202363] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:43:38,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:43:38,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 17] total 42 [2025-03-03 09:43:38,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68708805] [2025-03-03 09:43:38,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:43:38,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-03 09:43:38,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:38,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-03 09:43:38,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1384, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 09:43:38,339 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 42 states, 42 states have (on average 2.357142857142857) internal successors, (99), 42 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:42,573 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse0 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse5 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse4 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse9 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (and (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) .cse0 .cse1 .cse2) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (or (not .cse3) .cse4 .cse5 .cse6) (not .cse6) (or (not .cse5) .cse7 .cse6) (or .cse8 .cse3 (not .cse0) .cse9) (or .cse8 .cse2 (not .cse1)) (or (not .cse9) .cse6) (or .cse2 (not .cse7)) (or .cse5 .cse9 (not .cse8)) (or .cse1 (not .cse4) .cse7) (or .cse9 (not .cse2)))) is different from false [2025-03-03 09:43:46,582 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse3 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse2 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (and (or (not .cse0) .cse1 .cse2 .cse3) (not .cse3) (or (not .cse2) .cse4 .cse3) (or .cse5 .cse0 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) .cse6) (or .cse5 .cse7 (not .cse8)) (or (not .cse6) .cse3) (or .cse7 (not .cse4)) (or .cse2 .cse6 (not .cse5)) (or .cse8 (not .cse1) .cse4) (or .cse6 (not .cse7)))) is different from false [2025-03-03 09:44:54,692 WARN L286 SmtUtils]: Spent 58.73s on a formula simplification. DAG size of input: 77 DAG size of output: 68 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 09:44:56,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []