./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-nonlinear/bound-unconstrained.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/floats-nonlinear/bound-unconstrained.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 ad00e5072239abeb01a4bd441281195f8f9c10d5d349ac355ee2cfd51af3342b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:31:48,821 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:31:48,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:31:48,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:31:48,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:31:48,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:31:48,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:31:48,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:31:48,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:31:48,903 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:31:48,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:31:48,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:31:48,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:31:48,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:31:48,904 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:31:48,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:31:48,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:31:48,905 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:31:48,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:31:48,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:31:48,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:31:48,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:31:48,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:31:48,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:31:48,905 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:31:48,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:31:48,905 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:31:48,905 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:31:48,905 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:31:48,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:31:48,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:31:48,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:31:48,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:31:48,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:31:48,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:31:48,906 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:31:48,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:31:48,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:31:48,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:31:48,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:31:48,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:31:48,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:31:48,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:31:48,907 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 -> ad00e5072239abeb01a4bd441281195f8f9c10d5d349ac355ee2cfd51af3342b [2025-03-16 17:31:49,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:31:49,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:31:49,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:31:49,125 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:31:49,125 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:31:49,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-nonlinear/bound-unconstrained.c [2025-03-16 17:31:50,265 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2c65f10/6d4c0424984842d984772d4e14fc2e77/FLAG96322e4f8 [2025-03-16 17:31:50,501 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:31:50,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/bound-unconstrained.c [2025-03-16 17:31:50,507 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2c65f10/6d4c0424984842d984772d4e14fc2e77/FLAG96322e4f8 [2025-03-16 17:31:50,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2c65f10/6d4c0424984842d984772d4e14fc2e77 [2025-03-16 17:31:50,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:31:50,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:31:50,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:31:50,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:31:50,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:31:50,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:31:50" (1/1) ... [2025-03-16 17:31:50,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@758d9311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:50, skipping insertion in model container [2025-03-16 17:31:50,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:31:50" (1/1) ... [2025-03-16 17:31:50,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:31:50,630 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/floats-nonlinear/bound-unconstrained.c[620,633] [2025-03-16 17:31:50,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:31:50,661 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:31:50,670 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/floats-nonlinear/bound-unconstrained.c[620,633] [2025-03-16 17:31:50,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:31:50,687 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:31:50,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:50 WrapperNode [2025-03-16 17:31:50,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:31:50,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:31:50,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:31:50,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:31:50,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:50" (1/1) ... [2025-03-16 17:31:50,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:50" (1/1) ... [2025-03-16 17:31:50,717 INFO L138 Inliner]: procedures = 20, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 125 [2025-03-16 17:31:50,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:31:50,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:31:50,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:31:50,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:31:50,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:50" (1/1) ... [2025-03-16 17:31:50,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:50" (1/1) ... [2025-03-16 17:31:50,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:50" (1/1) ... [2025-03-16 17:31:50,735 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2025-03-16 17:31:50,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:50" (1/1) ... [2025-03-16 17:31:50,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:50" (1/1) ... [2025-03-16 17:31:50,739 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:50" (1/1) ... [2025-03-16 17:31:50,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:50" (1/1) ... [2025-03-16 17:31:50,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:50" (1/1) ... [2025-03-16 17:31:50,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:50" (1/1) ... [2025-03-16 17:31:50,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:31:50,745 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:31:50,745 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:31:50,745 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:31:50,746 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:50" (1/1) ... [2025-03-16 17:31:50,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:31:50,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:31:50,770 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-16 17:31:50,772 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-16 17:31:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:31:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:31:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 17:31:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 17:31:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-16 17:31:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-16 17:31:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2025-03-16 17:31:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2025-03-16 17:31:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:31:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:31:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-16 17:31:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-16 17:31:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 17:31:50,842 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:31:50,844 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:31:50,982 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L32: call ULTIMATE.dealloc(check_diffs_~#di~0#1.base, check_diffs_~#di~0#1.offset);havoc check_diffs_~#di~0#1.base, check_diffs_~#di~0#1.offset; [2025-03-16 17:31:50,999 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-03-16 17:31:50,999 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:31:51,006 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:31:51,006 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:31:51,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:31:51 BoogieIcfgContainer [2025-03-16 17:31:51,007 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:31:51,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:31:51,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:31:51,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:31:51,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:31:50" (1/3) ... [2025-03-16 17:31:51,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50658a53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:31:51, skipping insertion in model container [2025-03-16 17:31:51,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:50" (2/3) ... [2025-03-16 17:31:51,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50658a53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:31:51, skipping insertion in model container [2025-03-16 17:31:51,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:31:51" (3/3) ... [2025-03-16 17:31:51,013 INFO L128 eAbstractionObserver]: Analyzing ICFG bound-unconstrained.c [2025-03-16 17:31:51,022 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:31:51,023 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bound-unconstrained.c that has 2 procedures, 32 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 17:31:51,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:31:51,066 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;@7dd37405, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:31:51,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:31:51,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 17:31:51,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 17:31:51,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:31:51,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:31:51,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:31:51,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:31:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash -777038030, now seen corresponding path program 1 times [2025-03-16 17:31:51,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:31:51,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265573906] [2025-03-16 17:31:51,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:31:51,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:31:51,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 17:31:51,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 17:31:51,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:31:51,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:31:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:31:51,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:31:51,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265573906] [2025-03-16 17:31:51,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265573906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:31:51,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:31:51,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:31:51,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352389336] [2025-03-16 17:31:51,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:31:51,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:31:51,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:31:51,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:31:51,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:31:51,334 INFO L87 Difference]: Start difference. First operand has 32 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:31:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:31:51,376 INFO L93 Difference]: Finished difference Result 62 states and 87 transitions. [2025-03-16 17:31:51,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:31:51,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-16 17:31:51,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:31:51,382 INFO L225 Difference]: With dead ends: 62 [2025-03-16 17:31:51,383 INFO L226 Difference]: Without dead ends: 33 [2025-03-16 17:31:51,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:31:51,387 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:31:51,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:31:51,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-16 17:31:51,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-16 17:31:51,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 17:31:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2025-03-16 17:31:51,415 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 18 [2025-03-16 17:31:51,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:31:51,415 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2025-03-16 17:31:51,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:31:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2025-03-16 17:31:51,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 17:31:51,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:31:51,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:31:51,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:31:51,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:31:51,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:31:51,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2056901708, now seen corresponding path program 1 times [2025-03-16 17:31:51,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:31:51,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982934153] [2025-03-16 17:31:51,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:31:51,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:31:51,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 17:31:51,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 17:31:51,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:31:51,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:31:51,496 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-16 17:31:51,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:31:51,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982934153] [2025-03-16 17:31:51,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982934153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:31:51,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:31:51,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:31:51,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027195315] [2025-03-16 17:31:51,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:31:51,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:31:51,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:31:51,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:31:51,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:31:51,499 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:31:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:31:51,534 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2025-03-16 17:31:51,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:31:51,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-16 17:31:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:31:51,535 INFO L225 Difference]: With dead ends: 45 [2025-03-16 17:31:51,536 INFO L226 Difference]: Without dead ends: 36 [2025-03-16 17:31:51,536 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-16 17:31:51,537 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:31:51,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:31:51,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-16 17:31:51,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-16 17:31:51,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 17:31:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2025-03-16 17:31:51,542 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 18 [2025-03-16 17:31:51,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:31:51,544 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2025-03-16 17:31:51,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:31:51,544 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2025-03-16 17:31:51,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 17:31:51,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:31:51,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:31:51,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:31:51,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:31:51,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:31:51,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2056842126, now seen corresponding path program 1 times [2025-03-16 17:31:51,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:31:51,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12191414] [2025-03-16 17:31:51,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:31:51,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:31:51,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 17:31:51,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 17:31:51,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:31:51,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:31:51,637 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-16 17:31:51,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:31:51,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12191414] [2025-03-16 17:31:51,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12191414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:31:51,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:31:51,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:31:51,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982444501] [2025-03-16 17:31:51,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:31:51,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:31:51,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:31:51,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:31:51,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:31:51,639 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:31:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:31:51,648 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2025-03-16 17:31:51,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:31:51,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-16 17:31:51,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:31:51,649 INFO L225 Difference]: With dead ends: 40 [2025-03-16 17:31:51,650 INFO L226 Difference]: Without dead ends: 33 [2025-03-16 17:31:51,650 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-16 17:31:51,650 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:31:51,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:31:51,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-16 17:31:51,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-16 17:31:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 17:31:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2025-03-16 17:31:51,654 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 18 [2025-03-16 17:31:51,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:31:51,654 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2025-03-16 17:31:51,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:31:51,654 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2025-03-16 17:31:51,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 17:31:51,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:31:51,655 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:31:51,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 17:31:51,655 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:31:51,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:31:51,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1276552211, now seen corresponding path program 1 times [2025-03-16 17:31:51,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:31:51,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772718651] [2025-03-16 17:31:51,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:31:51,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:31:51,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 17:31:51,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 17:31:51,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:31:51,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:31:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 17:31:51,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:31:51,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772718651] [2025-03-16 17:31:51,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772718651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:31:51,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:31:51,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:31:51,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282098998] [2025-03-16 17:31:51,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:31:51,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:31:51,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:31:51,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:31:51,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:31:51,708 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:31:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:31:51,727 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2025-03-16 17:31:51,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:31:51,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-03-16 17:31:51,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:31:51,728 INFO L225 Difference]: With dead ends: 54 [2025-03-16 17:31:51,728 INFO L226 Difference]: Without dead ends: 33 [2025-03-16 17:31:51,728 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-16 17:31:51,729 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:31:51,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:31:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-16 17:31:51,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-16 17:31:51,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 17:31:51,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2025-03-16 17:31:51,733 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 26 [2025-03-16 17:31:51,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:31:51,733 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-03-16 17:31:51,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:31:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2025-03-16 17:31:51,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 17:31:51,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:31:51,734 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:31:51,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 17:31:51,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:31:51,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:31:51,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1815231831, now seen corresponding path program 1 times [2025-03-16 17:31:51,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:31:51,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271068169] [2025-03-16 17:31:51,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:31:51,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:31:51,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 17:31:51,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 17:31:51,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:31:51,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:31:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 17:31:51,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:31:51,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271068169] [2025-03-16 17:31:51,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271068169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:31:51,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:31:51,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:31:51,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126301664] [2025-03-16 17:31:51,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:31:51,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:31:51,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:31:51,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:31:51,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:31:51,818 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 17:31:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:31:51,838 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2025-03-16 17:31:51,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:31:51,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2025-03-16 17:31:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:31:51,839 INFO L225 Difference]: With dead ends: 58 [2025-03-16 17:31:51,839 INFO L226 Difference]: Without dead ends: 33 [2025-03-16 17:31:51,840 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-16 17:31:51,840 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:31:51,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:31:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-16 17:31:51,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2025-03-16 17:31:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 17:31:51,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-16 17:31:51,846 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 32 [2025-03-16 17:31:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:31:51,846 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-16 17:31:51,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 17:31:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-03-16 17:31:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 17:31:51,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:31:51,848 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:31:51,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 17:31:51,848 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:31:51,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:31:51,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1408609498, now seen corresponding path program 1 times [2025-03-16 17:31:51,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:31:51,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676633762] [2025-03-16 17:31:51,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:31:51,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:31:51,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 17:31:51,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 17:31:51,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:31:51,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:31:51,910 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 17:31:51,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:31:51,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676633762] [2025-03-16 17:31:51,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676633762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:31:51,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:31:51,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:31:51,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759727981] [2025-03-16 17:31:51,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:31:51,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:31:51,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:31:51,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:31:51,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:31:51,912 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:31:51,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:31:51,925 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2025-03-16 17:31:51,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:31:51,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2025-03-16 17:31:51,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:31:51,927 INFO L225 Difference]: With dead ends: 39 [2025-03-16 17:31:51,927 INFO L226 Difference]: Without dead ends: 33 [2025-03-16 17:31:51,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:31:51,928 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:31:51,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 62 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:31:51,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-16 17:31:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2025-03-16 17:31:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 17:31:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-03-16 17:31:51,933 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 38 [2025-03-16 17:31:51,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:31:51,933 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-16 17:31:51,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:31:51,933 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-03-16 17:31:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 17:31:51,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:31:51,934 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:31:51,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 17:31:51,934 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:31:51,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:31:51,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1248172403, now seen corresponding path program 1 times [2025-03-16 17:31:51,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:31:51,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314235586] [2025-03-16 17:31:51,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:31:51,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:31:51,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 17:31:51,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 17:31:51,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:31:51,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:31:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 17:31:52,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:31:52,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314235586] [2025-03-16 17:31:52,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314235586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:31:52,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:31:52,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:31:52,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247318228] [2025-03-16 17:31:52,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:31:52,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:31:52,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:31:52,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:31:52,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:31:52,022 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:31:52,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:31:52,050 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2025-03-16 17:31:52,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:31:52,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2025-03-16 17:31:52,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:31:52,052 INFO L225 Difference]: With dead ends: 45 [2025-03-16 17:31:52,052 INFO L226 Difference]: Without dead ends: 36 [2025-03-16 17:31:52,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:31:52,052 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:31:52,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 89 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:31:52,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-16 17:31:52,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2025-03-16 17:31:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 17:31:52,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-03-16 17:31:52,059 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 40 [2025-03-16 17:31:52,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:31:52,060 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-16 17:31:52,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:31:52,061 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-03-16 17:31:52,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 17:31:52,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:31:52,061 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:31:52,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 17:31:52,061 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:31:52,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:31:52,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1902223499, now seen corresponding path program 1 times [2025-03-16 17:31:52,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:31:52,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533347873] [2025-03-16 17:31:52,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:31:52,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:31:52,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 17:31:52,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 17:31:52,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:31:52,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:31:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 17:31:52,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:31:52,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533347873] [2025-03-16 17:31:52,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533347873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:31:52,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:31:52,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:31:52,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702634327] [2025-03-16 17:31:52,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:31:52,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:31:52,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:31:52,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:31:52,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:31:52,150 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:31:52,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:31:52,174 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2025-03-16 17:31:52,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:31:52,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2025-03-16 17:31:52,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:31:52,175 INFO L225 Difference]: With dead ends: 37 [2025-03-16 17:31:52,175 INFO L226 Difference]: Without dead ends: 31 [2025-03-16 17:31:52,175 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-16 17:31:52,176 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:31:52,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:31:52,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-16 17:31:52,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-16 17:31:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 17:31:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-03-16 17:31:52,181 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 40 [2025-03-16 17:31:52,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:31:52,181 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-16 17:31:52,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:31:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2025-03-16 17:31:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 17:31:52,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:31:52,182 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:31:52,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 17:31:52,182 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:31:52,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:31:52,185 INFO L85 PathProgramCache]: Analyzing trace with hash 241501204, now seen corresponding path program 1 times [2025-03-16 17:31:52,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:31:52,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609075522] [2025-03-16 17:31:52,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:31:52,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:31:52,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 17:31:52,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 17:31:52,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:31:52,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:31:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 17:31:52,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:31:52,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609075522] [2025-03-16 17:31:52,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609075522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:31:52,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716742179] [2025-03-16 17:31:52,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:31:52,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:31:52,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:31:52,263 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-16 17:31:52,265 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-16 17:31:52,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 17:31:52,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 17:31:52,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:31:52,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:31:52,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 17:31:52,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:31:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 17:31:52,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:31:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 17:31:52,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716742179] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:31:52,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:31:52,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-16 17:31:52,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201461295] [2025-03-16 17:31:52,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:31:52,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 17:31:52,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:31:52,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 17:31:52,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:31:52,456 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:31:52,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:31:52,527 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2025-03-16 17:31:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 17:31:52,528 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2025-03-16 17:31:52,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:31:52,529 INFO L225 Difference]: With dead ends: 55 [2025-03-16 17:31:52,530 INFO L226 Difference]: Without dead ends: 46 [2025-03-16 17:31:52,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-03-16 17:31:52,531 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:31:52,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 112 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:31:52,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-16 17:31:52,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2025-03-16 17:31:52,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 17:31:52,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-03-16 17:31:52,536 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 42 [2025-03-16 17:31:52,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:31:52,538 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-16 17:31:52,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:31:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-03-16 17:31:52,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 17:31:52,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:31:52,539 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:31:52,547 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-16 17:31:52,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:31:52,740 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:31:52,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:31:52,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1163779666, now seen corresponding path program 2 times [2025-03-16 17:31:52,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:31:52,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571360977] [2025-03-16 17:31:52,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:31:52,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:31:52,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-16 17:31:52,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 17:31:52,768 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:31:52,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:31:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-16 17:31:52,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:31:52,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571360977] [2025-03-16 17:31:52,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571360977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:31:52,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593374264] [2025-03-16 17:31:52,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:31:52,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:31:52,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:31:52,844 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-16 17:31:52,846 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-16 17:31:52,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-16 17:31:52,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 17:31:52,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:31:52,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:31:52,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 17:31:52,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:31:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 17:31:52,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:31:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 17:31:53,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593374264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:31:53,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:31:53,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 9 [2025-03-16 17:31:53,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24093527] [2025-03-16 17:31:53,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:31:53,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 17:31:53,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:31:53,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 17:31:53,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:31:53,035 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:31:53,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:31:53,120 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2025-03-16 17:31:53,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 17:31:53,121 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 54 [2025-03-16 17:31:53,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:31:53,121 INFO L225 Difference]: With dead ends: 64 [2025-03-16 17:31:53,121 INFO L226 Difference]: Without dead ends: 54 [2025-03-16 17:31:53,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2025-03-16 17:31:53,122 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:31:53,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 139 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:31:53,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-16 17:31:53,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2025-03-16 17:31:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 17:31:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-03-16 17:31:53,129 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 54 [2025-03-16 17:31:53,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:31:53,130 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-03-16 17:31:53,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:31:53,130 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-03-16 17:31:53,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 17:31:53,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:31:53,133 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:31:53,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 17:31:53,333 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,SelfDestructingSolverStorable9 [2025-03-16 17:31:53,334 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:31:53,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:31:53,335 INFO L85 PathProgramCache]: Analyzing trace with hash -843004914, now seen corresponding path program 3 times [2025-03-16 17:31:53,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:31:53,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617428938] [2025-03-16 17:31:53,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:31:53,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:31:53,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 11 equivalence classes. [2025-03-16 17:31:53,357 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 52 of 62 statements. [2025-03-16 17:31:53,357 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-16 17:31:53,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:31:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 17:31:53,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:31:53,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617428938] [2025-03-16 17:31:53,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617428938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:31:53,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441272977] [2025-03-16 17:31:53,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:31:53,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:31:53,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:31:53,430 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-16 17:31:53,431 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-16 17:31:53,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 11 equivalence classes. [2025-03-16 17:31:53,512 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 52 of 62 statements. [2025-03-16 17:31:53,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-16 17:31:53,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:31:53,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 17:31:53,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:31:53,527 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 17:31:53,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:31:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 17:31:53,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441272977] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 17:31:53,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:31:53,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 8 [2025-03-16 17:31:53,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817758281] [2025-03-16 17:31:53,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:31:53,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:31:53,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:31:53,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:31:53,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:31:53,574 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:31:53,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:31:53,619 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2025-03-16 17:31:53,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:31:53,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2025-03-16 17:31:53,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:31:53,620 INFO L225 Difference]: With dead ends: 61 [2025-03-16 17:31:53,620 INFO L226 Difference]: Without dead ends: 55 [2025-03-16 17:31:53,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:31:53,621 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:31:53,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 85 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:31:53,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-16 17:31:53,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-16 17:31:53,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 17:31:53,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2025-03-16 17:31:53,625 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 62 [2025-03-16 17:31:53,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:31:53,625 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2025-03-16 17:31:53,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:31:53,625 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2025-03-16 17:31:53,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 17:31:53,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:31:53,626 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:31:53,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 17:31:53,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:31:53,830 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:31:53,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:31:53,830 INFO L85 PathProgramCache]: Analyzing trace with hash -240557752, now seen corresponding path program 4 times [2025-03-16 17:31:53,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:31:53,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498235750] [2025-03-16 17:31:53,831 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 17:31:53,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:31:53,842 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 66 statements into 2 equivalence classes. [2025-03-16 17:31:53,855 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 17:31:53,856 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 17:31:53,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 17:31:53,856 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 17:31:53,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 17:31:53,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 17:31:53,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:31:53,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 17:31:53,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 17:31:53,884 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 17:31:53,884 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 17:31:53,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 17:31:53,889 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:31:53,917 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 17:31:53,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 05:31:53 BoogieIcfgContainer [2025-03-16 17:31:53,920 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 17:31:53,920 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 17:31:53,920 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 17:31:53,920 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 17:31:53,921 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:31:51" (3/4) ... [2025-03-16 17:31:53,922 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 17:31:53,922 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 17:31:53,923 INFO L158 Benchmark]: Toolchain (without parser) took 3402.17ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 113.7MB in the end (delta: 9.1MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2025-03-16 17:31:53,923 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 201.3MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:31:53,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.79ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 111.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:31:53,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.10ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 109.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:31:53,923 INFO L158 Benchmark]: Boogie Preprocessor took 26.85ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 108.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:31:53,923 INFO L158 Benchmark]: IcfgBuilder took 261.80ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 93.5MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:31:53,924 INFO L158 Benchmark]: TraceAbstraction took 2911.70ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 113.7MB in the end (delta: -20.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:31:53,924 INFO L158 Benchmark]: Witness Printer took 2.19ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 113.7MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:31:53,925 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.96ms. Allocated memory is still 201.3MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.79ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 111.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.10ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 109.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.85ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 108.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 261.80ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 93.5MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2911.70ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 113.7MB in the end (delta: -20.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.19ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 113.7MB in the end (delta: 33.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: 20]: 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 someBinaryDOUBLEComparisonOperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 36, overapproximation of someBinaryDOUBLEComparisonOperation at line 27. Possible FailurePath: [L49] double x, y, z, w; [L50] x = __VERIFIER_nondet_double() [L51] y = __VERIFIER_nondet_double() [L52] z = __VERIFIER_nondet_double() [L53] w = __VERIFIER_nondet_double() [L54] CALL, EXPR solve(x, y, z, w) [L41] CALL, EXPR check_domain(x1) VAL [\old(x)=5] [L27] COND TRUE x >= 1.0 && x <= 10.0 [L27] return 1; VAL [\old(x)=5, \result=1] [L41] RET, EXPR check_domain(x1) VAL [x1=5, x2=7, x3=6, x4=8] [L41] EXPR check_domain(x1) && check_domain(x2) VAL [x1=5, x2=7, x3=6, x4=8] [L41] CALL, EXPR check_domain(x2) VAL [\old(x)=7] [L27] COND TRUE x >= 1.0 && x <= 10.0 [L27] return 1; VAL [\old(x)=7, \result=1] [L41] RET, EXPR check_domain(x2) VAL [x1=5, x2=7, x3=6, x4=8] [L41] EXPR check_domain(x1) && check_domain(x2) VAL [x1=5, x2=7, x3=6, x4=8] [L41] EXPR check_domain(x1) && check_domain(x2) && check_domain(x3) VAL [x1=5, x2=7, x3=6, x4=8] [L41] CALL, EXPR check_domain(x3) VAL [\old(x)=6] [L27] COND TRUE x >= 1.0 && x <= 10.0 [L27] return 1; VAL [\old(x)=6, \result=1] [L41] RET, EXPR check_domain(x3) VAL [x1=5, x2=7, x3=6, x4=8] [L41] EXPR check_domain(x1) && check_domain(x2) && check_domain(x3) VAL [x1=5, x2=7, x3=6, x4=8] [L41-L42] EXPR check_domain(x1) && check_domain(x2) && check_domain(x3) && check_domain(x4) VAL [x1=5, x2=7, x3=6, x4=8] [L42] CALL, EXPR check_domain(x4) VAL [\old(x)=8] [L27] COND TRUE x >= 1.0 && x <= 10.0 [L27] return 1; VAL [\old(x)=8, \result=1] [L42] RET, EXPR check_domain(x4) VAL [x1=5, x2=7, x3=6, x4=8] [L41-L42] EXPR check_domain(x1) && check_domain(x2) && check_domain(x3) && check_domain(x4) VAL [x1=5, x2=7, x3=6, x4=8] [L41-L42] EXPR check_domain(x1) && check_domain(x2) && check_domain(x3) && check_domain(x4) && check_diffs(x1, x2, x3, x4) VAL [x1=5, x2=7, x3=6, x4=8] [L41-L42] EXPR check_domain(x1) && check_domain(x2) && check_domain(x3) && check_domain(x4) && check_diffs(x1, x2, x3, x4) [L42] CALL, EXPR check_diffs(x1, x2, x3, x4) [L31] int check_mark = 1; [L32] double di[4] = {x1, x2, x3, x4}; [L32] double di[4] = {x1, x2, x3, x4}; [L32] double di[4] = {x1, x2, x3, x4}; [L32] double di[4] = {x1, x2, x3, x4}; [L32] double di[4] = {x1, x2, x3, x4}; [L34] int i = 0; VAL [check_mark=1, di={4:0}, i=0] [L34] COND TRUE i < 4 [L35] int j = i; VAL [check_mark=1, di={4:0}, i=0, j=0] [L35] COND TRUE j < 4 [L36] EXPR di[i] [L36] EXPR di[j] [L36] COND FALSE !(di[i] == di[j]) [L35] j++ VAL [check_mark=1, di={4:0}, i=0, j=1] [L35] COND TRUE j < 4 [L36] EXPR di[i] [L36] EXPR di[j] [L36] COND FALSE !(di[i] == di[j]) [L35] j++ VAL [check_mark=1, di={4:0}, i=0, j=2] [L35] COND TRUE j < 4 [L36] EXPR di[i] [L36] EXPR di[j] [L36] COND FALSE !(di[i] == di[j]) [L35] j++ VAL [check_mark=1, di={4:0}, i=0, j=3] [L35] COND TRUE j < 4 [L36] EXPR di[i] [L36] EXPR di[j] [L36] COND FALSE !(di[i] == di[j]) [L35] j++ VAL [check_mark=1, di={4:0}, i=0, j=4] [L35] COND FALSE !(j < 4) [L34] i++ VAL [check_mark=1, di={4:0}, i=1] [L34] COND TRUE i < 4 [L35] int j = i; VAL [check_mark=1, di={4:0}, i=1, j=1] [L35] COND TRUE j < 4 [L36] EXPR di[i] [L36] EXPR di[j] [L36] COND FALSE !(di[i] == di[j]) [L35] j++ VAL [check_mark=1, di={4:0}, i=1, j=2] [L35] COND TRUE j < 4 [L36] EXPR di[i] [L36] EXPR di[j] [L36] COND FALSE !(di[i] == di[j]) [L35] j++ VAL [check_mark=1, di={4:0}, i=1, j=3] [L35] COND TRUE j < 4 [L36] EXPR di[i] [L36] EXPR di[j] [L36] COND FALSE !(di[i] == di[j]) [L35] j++ VAL [check_mark=1, di={4:0}, i=1, j=4] [L35] COND FALSE !(j < 4) [L34] i++ VAL [check_mark=1, di={4:0}, i=2] [L34] COND TRUE i < 4 [L35] int j = i; VAL [check_mark=1, di={4:0}, i=2, j=2] [L35] COND TRUE j < 4 [L36] EXPR di[i] [L36] EXPR di[j] [L36] COND FALSE !(di[i] == di[j]) [L35] j++ VAL [check_mark=1, di={4:0}, i=2, j=3] [L35] COND TRUE j < 4 [L36] EXPR di[i] [L36] EXPR di[j] [L36] COND FALSE !(di[i] == di[j]) [L35] j++ VAL [check_mark=1, di={4:0}, i=2, j=4] [L35] COND FALSE !(j < 4) [L34] i++ VAL [check_mark=1, di={4:0}, i=3] [L34] COND TRUE i < 4 [L35] int j = i; VAL [check_mark=1, di={4:0}, i=3, j=3] [L35] COND TRUE j < 4 [L36] EXPR di[i] [L36] EXPR di[j] [L36] COND FALSE !(di[i] == di[j]) [L35] j++ VAL [check_mark=1, di={4:0}, i=3, j=4] [L35] COND FALSE !(j < 4) [L34] i++ VAL [check_mark=1, di={4:0}, i=4] [L34] COND FALSE !(i < 4) [L38] return check_mark; [L32] double di[4] = {x1, x2, x3, x4}; [L38] return check_mark; VAL [\result=1] [L42] RET, EXPR check_diffs(x1, x2, x3, x4) [L41-L42] EXPR check_domain(x1) && check_domain(x2) && check_domain(x3) && check_domain(x4) && check_diffs(x1, x2, x3, x4) [L41-L42] COND TRUE check_domain(x1) && check_domain(x2) && check_domain(x3) && check_domain(x4) && check_diffs(x1, x2, x3, x4) && x1 + x2 + x3 + x4 == 9 [L43] return 1; VAL [\result=1] [L54] RET, EXPR solve(x, y, z, w) [L54] CALL __VERIFIER_assert(!solve(x, y, z, w)) [L18] COND TRUE !(cond) [L20] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 48 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 12, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 1131 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 754 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 188 IncrementalHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 377 mSDtfsCounter, 188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 375 GetRequests, 314 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=11, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 612 NumberOfCodeBlocks, 592 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 687 ConstructedInterpolants, 0 QuantifiedInterpolants, 888 SizeOfPredicates, 3 NumberOfNonLiveVariables, 648 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 682/773 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 17:31:53,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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/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/floats-nonlinear/bound-unconstrained.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad00e5072239abeb01a4bd441281195f8f9c10d5d349ac355ee2cfd51af3342b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:31:55,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:31:55,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 17:31:55,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:31:55,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:31:55,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:31:55,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:31:55,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:31:55,710 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:31:55,710 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:31:55,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:31:55,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:31:55,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:31:55,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:31:55,712 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:31:55,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:31:55,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:31:55,712 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:31:55,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:31:55,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:31:55,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:31:55,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:31:55,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:31:55,713 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 17:31:55,713 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 17:31:55,713 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 17:31:55,713 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:31:55,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:31:55,713 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:31:55,713 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:31:55,714 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:31:55,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:31:55,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:31:55,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:31:55,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:31:55,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:31:55,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:31:55,714 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:31:55,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:31:55,715 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 17:31:55,715 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 17:31:55,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:31:55,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:31:55,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:31:55,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:31:55,715 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 -> ad00e5072239abeb01a4bd441281195f8f9c10d5d349ac355ee2cfd51af3342b [2025-03-16 17:31:55,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:31:55,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:31:55,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:31:55,935 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:31:55,935 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:31:55,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-nonlinear/bound-unconstrained.c [2025-03-16 17:31:57,037 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d3c2bd53/8a07c01e8f1c411eb959d99098c68e06/FLAGeefbba5cb [2025-03-16 17:31:57,234 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:31:57,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/bound-unconstrained.c [2025-03-16 17:31:57,255 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d3c2bd53/8a07c01e8f1c411eb959d99098c68e06/FLAGeefbba5cb [2025-03-16 17:31:57,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d3c2bd53/8a07c01e8f1c411eb959d99098c68e06 [2025-03-16 17:31:57,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:31:57,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:31:57,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:31:57,279 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:31:57,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:31:57,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:31:57" (1/1) ... [2025-03-16 17:31:57,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7abcadc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:57, skipping insertion in model container [2025-03-16 17:31:57,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:31:57" (1/1) ... [2025-03-16 17:31:57,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:31:57,396 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/bound-unconstrained.c[620,633] [2025-03-16 17:31:57,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:31:57,429 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:31:57,437 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/floats-nonlinear/bound-unconstrained.c[620,633] [2025-03-16 17:31:57,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:31:57,454 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:31:57,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:57 WrapperNode [2025-03-16 17:31:57,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:31:57,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:31:57,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:31:57,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:31:57,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:57" (1/1) ... [2025-03-16 17:31:57,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:57" (1/1) ... [2025-03-16 17:31:57,490 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2025-03-16 17:31:57,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:31:57,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:31:57,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:31:57,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:31:57,497 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:57" (1/1) ... [2025-03-16 17:31:57,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:57" (1/1) ... [2025-03-16 17:31:57,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:57" (1/1) ... [2025-03-16 17:31:57,514 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2025-03-16 17:31:57,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:57" (1/1) ... [2025-03-16 17:31:57,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:57" (1/1) ... [2025-03-16 17:31:57,521 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:57" (1/1) ... [2025-03-16 17:31:57,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:57" (1/1) ... [2025-03-16 17:31:57,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:57" (1/1) ... [2025-03-16 17:31:57,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:57" (1/1) ... [2025-03-16 17:31:57,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:31:57,532 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:31:57,532 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:31:57,532 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:31:57,533 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:57" (1/1) ... [2025-03-16 17:31:57,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:31:57,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:31:57,558 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-16 17:31:57,562 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-16 17:31:57,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:31:57,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-16 17:31:57,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-16 17:31:57,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 17:31:57,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-16 17:31:57,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 17:31:57,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-16 17:31:57,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-16 17:31:57,580 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2025-03-16 17:31:57,580 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2025-03-16 17:31:57,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:31:57,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:31:57,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 17:31:57,646 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:31:57,648 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:32:02,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L32: call ULTIMATE.dealloc(check_diffs_~#di~0#1.base, check_diffs_~#di~0#1.offset);havoc check_diffs_~#di~0#1.base, check_diffs_~#di~0#1.offset; [2025-03-16 17:32:02,490 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-03-16 17:32:02,490 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:32:02,496 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:32:02,496 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:32:02,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:32:02 BoogieIcfgContainer [2025-03-16 17:32:02,496 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:32:02,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:32:02,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:32:02,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:32:02,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:31:57" (1/3) ... [2025-03-16 17:32:02,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c0e511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:32:02, skipping insertion in model container [2025-03-16 17:32:02,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:31:57" (2/3) ... [2025-03-16 17:32:02,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c0e511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:32:02, skipping insertion in model container [2025-03-16 17:32:02,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:32:02" (3/3) ... [2025-03-16 17:32:02,503 INFO L128 eAbstractionObserver]: Analyzing ICFG bound-unconstrained.c [2025-03-16 17:32:02,512 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:32:02,513 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bound-unconstrained.c that has 2 procedures, 32 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 17:32:02,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:32:02,554 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;@600752a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:32:02,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:32:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 17:32:02,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 17:32:02,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:32:02,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:32:02,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:32:02,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:32:02,564 INFO L85 PathProgramCache]: Analyzing trace with hash -777038030, now seen corresponding path program 1 times [2025-03-16 17:32:02,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:32:02,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960632860] [2025-03-16 17:32:02,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:32:02,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 17:32:02,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 17:32:02,572 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 17:32:02,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-16 17:32:02,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 17:32:02,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 17:32:02,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:32:02,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:32:02,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 17:32:02,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:32:02,827 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-16 17:32:02,827 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:32:02,828 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:32:02,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960632860] [2025-03-16 17:32:02,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960632860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:32:02,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:32:02,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:32:02,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511900201] [2025-03-16 17:32:02,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:32:02,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:32:02,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:32:02,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:32:02,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:32:02,856 INFO L87 Difference]: Start difference. First operand has 32 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:32:05,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:32:08,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:32:09,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:32:10,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:32:10,024 INFO L93 Difference]: Finished difference Result 62 states and 87 transitions. [2025-03-16 17:32:10,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:32:10,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-16 17:32:10,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:32:10,029 INFO L225 Difference]: With dead ends: 62 [2025-03-16 17:32:10,029 INFO L226 Difference]: Without dead ends: 33 [2025-03-16 17:32:10,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:32:10,032 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:32:10,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2025-03-16 17:32:10,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-16 17:32:10,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-16 17:32:10,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 17:32:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2025-03-16 17:32:10,060 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 18 [2025-03-16 17:32:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:32:10,060 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2025-03-16 17:32:10,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:32:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2025-03-16 17:32:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 17:32:10,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:32:10,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:32:10,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-16 17:32:10,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 17:32:10,262 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:32:10,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:32:10,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2056901708, now seen corresponding path program 1 times [2025-03-16 17:32:10,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:32:10,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609505710] [2025-03-16 17:32:10,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:32:10,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 17:32:10,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 17:32:10,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 17:32:10,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-16 17:32:10,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 17:32:10,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 17:32:10,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:32:10,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:32:10,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 17:32:10,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:32:10,527 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-16 17:32:10,527 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:32:10,527 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:32:10,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609505710] [2025-03-16 17:32:10,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609505710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:32:10,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:32:10,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 17:32:10,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634847743] [2025-03-16 17:32:10,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:32:10,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 17:32:10,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:32:10,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 17:32:10,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:32:10,528 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:32:12,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:32:15,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:32:15,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:32:15,839 INFO L93 Difference]: Finished difference Result 67 states and 96 transitions. [2025-03-16 17:32:15,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 17:32:15,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-16 17:32:15,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:32:15,857 INFO L225 Difference]: With dead ends: 67 [2025-03-16 17:32:15,857 INFO L226 Difference]: Without dead ends: 40 [2025-03-16 17:32:15,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:32:15,857 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-16 17:32:15,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-16 17:32:15,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-16 17:32:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-16 17:32:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 17:32:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2025-03-16 17:32:15,864 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 18 [2025-03-16 17:32:15,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:32:15,864 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2025-03-16 17:32:15,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:32:15,864 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2025-03-16 17:32:15,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 17:32:15,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:32:15,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:32:15,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-16 17:32:16,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 17:32:16,066 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:32:16,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:32:16,067 INFO L85 PathProgramCache]: Analyzing trace with hash -2056842126, now seen corresponding path program 1 times [2025-03-16 17:32:16,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:32:16,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177152] [2025-03-16 17:32:16,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:32:16,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 17:32:16,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 17:32:16,069 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 17:32:16,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-16 17:32:16,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 17:32:16,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 17:32:16,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:32:16,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:32:16,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 17:32:16,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:32:16,256 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-16 17:32:16,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:32:16,256 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:32:16,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177152] [2025-03-16 17:32:16,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:32:16,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:32:16,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:32:16,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024184396] [2025-03-16 17:32:16,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:32:16,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:32:16,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:32:16,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:32:16,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:32:16,257 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:32:19,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:32:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:32:19,170 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2025-03-16 17:32:19,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:32:19,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-16 17:32:19,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:32:19,171 INFO L225 Difference]: With dead ends: 44 [2025-03-16 17:32:19,171 INFO L226 Difference]: Without dead ends: 31 [2025-03-16 17:32:19,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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-16 17:32:19,171 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-16 17:32:19,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-16 17:32:19,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-16 17:32:19,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-16 17:32:19,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-16 17:32:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2025-03-16 17:32:19,176 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2025-03-16 17:32:19,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:32:19,176 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2025-03-16 17:32:19,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:32:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2025-03-16 17:32:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 17:32:19,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:32:19,177 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:32:19,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-16 17:32:19,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 17:32:19,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:32:19,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:32:19,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1408609498, now seen corresponding path program 1 times [2025-03-16 17:32:19,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:32:19,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655599131] [2025-03-16 17:32:19,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:32:19,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 17:32:19,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 17:32:19,381 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 17:32:19,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-16 17:32:19,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 17:32:19,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 17:32:19,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:32:19,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:32:19,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 17:32:19,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:32:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 17:32:19,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:32:19,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:32:19,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655599131] [2025-03-16 17:32:19,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655599131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:32:19,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:32:19,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:32:19,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424283089] [2025-03-16 17:32:19,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:32:19,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:32:19,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:32:19,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:32:19,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:32:19,615 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:32:19,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:32:19,647 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2025-03-16 17:32:19,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:32:19,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2025-03-16 17:32:19,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:32:19,648 INFO L225 Difference]: With dead ends: 41 [2025-03-16 17:32:19,648 INFO L226 Difference]: Without dead ends: 35 [2025-03-16 17:32:19,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:32:19,649 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:32:19,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 62 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:32:19,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-16 17:32:19,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2025-03-16 17:32:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-16 17:32:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-03-16 17:32:19,652 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 38 [2025-03-16 17:32:19,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:32:19,653 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-03-16 17:32:19,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:32:19,653 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-03-16 17:32:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 17:32:19,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:32:19,654 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:32:19,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-16 17:32:19,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 17:32:19,855 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:32:19,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:32:19,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1248172403, now seen corresponding path program 1 times [2025-03-16 17:32:19,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:32:19,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820180239] [2025-03-16 17:32:19,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:32:19,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 17:32:19,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 17:32:19,858 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 17:32:19,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-16 17:32:19,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 17:32:20,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 17:32:20,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:32:20,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:32:20,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 17:32:20,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:32:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 17:32:20,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:32:20,111 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:32:20,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820180239] [2025-03-16 17:32:20,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820180239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:32:20,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:32:20,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:32:20,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429926307] [2025-03-16 17:32:20,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:32:20,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:32:20,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:32:20,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:32:20,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:32:20,113 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:32:20,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:32:20,233 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2025-03-16 17:32:20,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:32:20,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2025-03-16 17:32:20,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:32:20,234 INFO L225 Difference]: With dead ends: 47 [2025-03-16 17:32:20,234 INFO L226 Difference]: Without dead ends: 38 [2025-03-16 17:32:20,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:32:20,235 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:32:20,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 89 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:32:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-16 17:32:20,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2025-03-16 17:32:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-16 17:32:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2025-03-16 17:32:20,239 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 40 [2025-03-16 17:32:20,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:32:20,239 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-03-16 17:32:20,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:32:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2025-03-16 17:32:20,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 17:32:20,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:32:20,240 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:32:20,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-16 17:32:20,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 17:32:20,441 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:32:20,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:32:20,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1902223499, now seen corresponding path program 1 times [2025-03-16 17:32:20,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:32:20,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173185016] [2025-03-16 17:32:20,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:32:20,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 17:32:20,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 17:32:20,443 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 17:32:20,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-16 17:32:20,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 17:32:20,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 17:32:20,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:32:20,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:32:20,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 17:32:20,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:32:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 17:32:20,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:32:20,728 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:32:20,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173185016] [2025-03-16 17:32:20,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173185016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:32:20,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:32:20,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:32:20,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427459089] [2025-03-16 17:32:20,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:32:20,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:32:20,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:32:20,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:32:20,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:32:20,729 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:32:24,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:32:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:32:24,752 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2025-03-16 17:32:24,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:32:24,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2025-03-16 17:32:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:32:24,753 INFO L225 Difference]: With dead ends: 39 [2025-03-16 17:32:24,753 INFO L226 Difference]: Without dead ends: 33 [2025-03-16 17:32:24,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 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-16 17:32:24,753 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:32:24,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-16 17:32:24,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-16 17:32:24,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-16 17:32:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-16 17:32:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-03-16 17:32:24,758 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 40 [2025-03-16 17:32:24,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:32:24,758 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-03-16 17:32:24,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:32:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-03-16 17:32:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 17:32:24,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:32:24,759 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:32:24,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-16 17:32:24,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 17:32:24,960 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:32:24,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:32:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash 241501204, now seen corresponding path program 1 times [2025-03-16 17:32:24,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:32:24,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361780593] [2025-03-16 17:32:24,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:32:24,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 17:32:24,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 17:32:24,962 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 17:32:24,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-16 17:32:24,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 17:32:25,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 17:32:25,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:32:25,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:32:25,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 17:32:25,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:32:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 17:32:25,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:32:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 17:32:25,304 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:32:25,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361780593] [2025-03-16 17:32:25,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361780593] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:32:25,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:32:25,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-16 17:32:25,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86153355] [2025-03-16 17:32:25,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:32:25,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 17:32:25,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:32:25,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 17:32:25,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:32:25,305 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:32:25,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:32:25,478 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2025-03-16 17:32:25,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 17:32:25,478 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2025-03-16 17:32:25,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:32:25,479 INFO L225 Difference]: With dead ends: 57 [2025-03-16 17:32:25,479 INFO L226 Difference]: Without dead ends: 48 [2025-03-16 17:32:25,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-03-16 17:32:25,481 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:32:25,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 191 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:32:25,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-16 17:32:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2025-03-16 17:32:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-16 17:32:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2025-03-16 17:32:25,489 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 42 [2025-03-16 17:32:25,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:32:25,491 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2025-03-16 17:32:25,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:32:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2025-03-16 17:32:25,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 17:32:25,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:32:25,492 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:32:25,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-16 17:32:25,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 17:32:25,693 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:32:25,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:32:25,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2103356023, now seen corresponding path program 2 times [2025-03-16 17:32:25,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:32:25,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379506757] [2025-03-16 17:32:25,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:32:25,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 17:32:25,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 17:32:25,696 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 17:32:25,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-16 17:32:25,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-16 17:32:26,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 17:32:26,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:32:26,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:32:26,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 17:32:26,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:32:26,128 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 17:32:26,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:32:26,227 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 17:32:26,228 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:32:26,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379506757] [2025-03-16 17:32:26,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379506757] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:32:26,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:32:26,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-16 17:32:26,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534547446] [2025-03-16 17:32:26,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:32:26,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:32:26,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:32:26,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:32:26,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:32:26,229 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:32:26,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:32:26,340 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2025-03-16 17:32:26,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:32:26,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2025-03-16 17:32:26,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:32:26,341 INFO L225 Difference]: With dead ends: 59 [2025-03-16 17:32:26,341 INFO L226 Difference]: Without dead ends: 53 [2025-03-16 17:32:26,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:32:26,342 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:32:26,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 116 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:32:26,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-16 17:32:26,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-16 17:32:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 47 states have internal predecessors, (52), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-16 17:32:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-03-16 17:32:26,347 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 48 [2025-03-16 17:32:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:32:26,347 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-03-16 17:32:26,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:32:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2025-03-16 17:32:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 17:32:26,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:32:26,348 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:32:26,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2025-03-16 17:32:26,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 17:32:26,549 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:32:26,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:32:26,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1765631942, now seen corresponding path program 3 times [2025-03-16 17:32:26,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:32:26,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615666371] [2025-03-16 17:32:26,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:32:26,550 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 17:32:26,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 17:32:26,551 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 17:32:26,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-16 17:32:26,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 11 equivalence classes. [2025-03-16 17:32:27,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 44 of 62 statements. [2025-03-16 17:32:27,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 17:32:27,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:32:27,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-16 17:32:27,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:32:27,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:32:27,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 35 [2025-03-16 17:32:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-16 17:32:27,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:32:27,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:32:27,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 33 [2025-03-16 17:32:28,082 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:32:28,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615666371] [2025-03-16 17:32:28,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615666371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:32:28,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [809739509] [2025-03-16 17:32:28,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:32:28,083 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-16 17:32:28,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-16 17:32:28,161 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-16 17:32:28,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2025-03-16 17:32:28,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 11 equivalence classes. [2025-03-16 17:32:29,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 44 of 62 statements. [2025-03-16 17:32:29,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 17:32:29,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:32:29,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 17:32:29,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:32:42,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:32:42,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 39 [2025-03-16 17:32:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-16 17:32:46,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:32:46,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:32:46,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 38 [2025-03-16 17:32:46,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [809739509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:32:46,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:32:46,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2025-03-16 17:32:46,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826899018] [2025-03-16 17:32:46,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:32:46,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 17:32:46,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:32:46,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 17:32:46,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=190, Unknown=4, NotChecked=0, Total=240 [2025-03-16 17:32:46,483 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:32:47,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:32:47,228 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2025-03-16 17:32:47,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 17:32:47,228 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 62 [2025-03-16 17:32:47,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:32:47,228 INFO L225 Difference]: With dead ends: 53 [2025-03-16 17:32:47,228 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 17:32:47,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=82, Invalid=256, Unknown=4, NotChecked=0, Total=342 [2025-03-16 17:32:47,229 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 17:32:47,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 131 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 17:32:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 17:32:47,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 17:32:47,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-16 17:32:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 17:32:47,231 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2025-03-16 17:32:47,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:32:47,231 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 17:32:47,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:32:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 17:32:47,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 17:32:47,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 17:32:47,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2025-03-16 17:32:47,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-16 17:32:47,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 17:32:47,636 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2025-03-16 17:32:47,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 17:32:47,759 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 17:32:47,764 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-16 17:32:47,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#di~0!offset [2025-03-16 17:32:47,766 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-16 17:32:47,767 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-16 17:32:47,767 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#di~0!offset [2025-03-16 17:32:47,767 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-16 17:32:47,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 05:32:47 BoogieIcfgContainer [2025-03-16 17:32:47,768 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 17:32:47,769 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 17:32:47,769 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 17:32:47,769 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 17:32:47,769 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:32:02" (3/4) ... [2025-03-16 17:32:47,770 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 17:32:47,774 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure check_domain [2025-03-16 17:32:47,776 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-03-16 17:32:47,776 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-16 17:32:47,777 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-16 17:32:47,777 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 17:32:47,835 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 17:32:47,836 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 17:32:47,836 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 17:32:47,837 INFO L158 Benchmark]: Toolchain (without parser) took 50559.54ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 65.6MB in the end (delta: 26.5MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2025-03-16 17:32:47,837 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:32:47,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.77ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 79.7MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:32:47,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.31ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 78.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:32:47,838 INFO L158 Benchmark]: Boogie Preprocessor took 37.60ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 76.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:32:47,839 INFO L158 Benchmark]: IcfgBuilder took 4964.47ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 59.9MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 17:32:47,839 INFO L158 Benchmark]: TraceAbstraction took 45269.88ms. Allocated memory is still 117.4MB. Free memory was 59.2MB in the beginning and 71.8MB in the end (delta: -12.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:32:47,840 INFO L158 Benchmark]: Witness Printer took 67.53ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 65.6MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:32:47,841 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.25ms. Allocated memory is still 117.4MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.77ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 79.7MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.31ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 78.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.60ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 76.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 4964.47ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 59.9MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 45269.88ms. Allocated memory is still 117.4MB. Free memory was 59.2MB in the beginning and 71.8MB in the end (delta: -12.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 67.53ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 65.6MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#di~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#di~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 20]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 48 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.1s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 20.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 1177 SdHoareTripleChecker+Invalid, 19.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 884 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 288 IncrementalHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 293 mSDtfsCounter, 288 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 543 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 18.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=8, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 18.8s InterpolantComputationTime, 386 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 464 ConstructedInterpolants, 34 QuantifiedInterpolants, 1233 SizeOfPredicates, 16 NumberOfNonLiveVariables, 989 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 441/463 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Location Invariant Derived location invariant: (0 == i) - InvariantResult [Line: 35]: Location Invariant Derived location invariant: ((0 == j) && (0 == i)) RESULT: Ultimate proved your program to be correct! [2025-03-16 17:32:47,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE