./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a09075700c0165e7f87ec4195e4b424ce35f231e25baba100aa11fb885230d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:39:08,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:39:08,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:39:08,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:39:08,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:39:08,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:39:08,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:39:08,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:39:08,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:39:08,807 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:39:08,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:39:08,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:39:08,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:39:08,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:39:08,808 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:39:08,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:39:08,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:39:08,809 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:39:08,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:39:08,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:39:08,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:39:08,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:39:08,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:39:08,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:39:08,810 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:39:08,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:39:08,810 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:39:08,810 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:39:08,811 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:39:08,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:39:08,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:39:08,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:39:08,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:39:08,811 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:39:08,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:39:08,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:39:08,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:39:08,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:39:08,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:39:08,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:39:08,813 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:39:08,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:39:08,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:39:08,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:39:08,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:39:08,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:39:08,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:39:08,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:39:08,813 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6a09075700c0165e7f87ec4195e4b424ce35f231e25baba100aa11fb885230d3 [2025-01-09 12:39:09,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:39:09,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:39:09,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:39:09,110 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:39:09,110 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:39:09,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i [2025-01-09 12:39:10,408 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d1e63dff/6232a28cc9de41e18e84e6e180a0fd15/FLAG2335f60ff [2025-01-09 12:39:10,727 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:39:10,727 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i [2025-01-09 12:39:10,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d1e63dff/6232a28cc9de41e18e84e6e180a0fd15/FLAG2335f60ff [2025-01-09 12:39:10,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d1e63dff/6232a28cc9de41e18e84e6e180a0fd15 [2025-01-09 12:39:10,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:39:10,757 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:39:10,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:39:10,759 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:39:10,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:39:10,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:39:10" (1/1) ... [2025-01-09 12:39:10,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14653dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:10, skipping insertion in model container [2025-01-09 12:39:10,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:39:10" (1/1) ... [2025-01-09 12:39:10,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:39:10,906 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i[916,929] [2025-01-09 12:39:10,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:39:10,970 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:39:10,982 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i[916,929] [2025-01-09 12:39:11,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:39:11,026 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:39:11,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:11 WrapperNode [2025-01-09 12:39:11,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:39:11,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:39:11,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:39:11,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:39:11,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:11" (1/1) ... [2025-01-09 12:39:11,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:11" (1/1) ... [2025-01-09 12:39:11,082 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2025-01-09 12:39:11,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:39:11,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:39:11,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:39:11,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:39:11,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:11" (1/1) ... [2025-01-09 12:39:11,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:11" (1/1) ... [2025-01-09 12:39:11,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:11" (1/1) ... [2025-01-09 12:39:11,124 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:39:11,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:11" (1/1) ... [2025-01-09 12:39:11,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:11" (1/1) ... [2025-01-09 12:39:11,136 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:11" (1/1) ... [2025-01-09 12:39:11,144 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:11" (1/1) ... [2025-01-09 12:39:11,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:11" (1/1) ... [2025-01-09 12:39:11,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:11" (1/1) ... [2025-01-09 12:39:11,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:11" (1/1) ... [2025-01-09 12:39:11,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:39:11,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:39:11,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:39:11,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:39:11,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:11" (1/1) ... [2025-01-09 12:39:11,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:39:11,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:39:11,187 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:39:11,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:39:11,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:39:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:39:11,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:39:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:39:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:39:11,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:39:11,278 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:39:11,281 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:39:11,623 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 12:39:11,623 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:39:11,635 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:39:11,636 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:39:11,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:39:11 BoogieIcfgContainer [2025-01-09 12:39:11,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:39:11,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:39:11,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:39:11,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:39:11,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:39:10" (1/3) ... [2025-01-09 12:39:11,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2687ca9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:39:11, skipping insertion in model container [2025-01-09 12:39:11,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:11" (2/3) ... [2025-01-09 12:39:11,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2687ca9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:39:11, skipping insertion in model container [2025-01-09 12:39:11,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:39:11" (3/3) ... [2025-01-09 12:39:11,647 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-18.i [2025-01-09 12:39:11,660 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:39:11,662 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-18.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:39:11,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:39:11,734 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;@92f1674, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:39:11,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:39:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 48 states have (on average 1.4375) internal successors, (69), 49 states have internal predecessors, (69), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 12:39:11,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 12:39:11,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:11,750 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:39:11,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:11,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:11,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1758844074, now seen corresponding path program 1 times [2025-01-09 12:39:11,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:11,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169750387] [2025-01-09 12:39:11,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:11,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:11,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 12:39:11,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 12:39:11,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:11,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 12:39:11,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:11,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169750387] [2025-01-09 12:39:11,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169750387] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:39:11,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394377045] [2025-01-09 12:39:11,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:11,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:39:11,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:39:11,991 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:39:11,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:39:12,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 12:39:12,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 12:39:12,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:12,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:12,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:39:12,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:39:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 12:39:12,148 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:39:12,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394377045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:12,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:39:12,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:39:12,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400820334] [2025-01-09 12:39:12,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:12,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:39:12,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:12,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:39:12,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:39:12,172 INFO L87 Difference]: Start difference. First operand has 65 states, 48 states have (on average 1.4375) internal successors, (69), 49 states have internal predecessors, (69), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 12:39:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:12,191 INFO L93 Difference]: Finished difference Result 124 states and 203 transitions. [2025-01-09 12:39:12,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:39:12,193 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 97 [2025-01-09 12:39:12,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:12,198 INFO L225 Difference]: With dead ends: 124 [2025-01-09 12:39:12,199 INFO L226 Difference]: Without dead ends: 62 [2025-01-09 12:39:12,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:39:12,203 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:12,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:39:12,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-09 12:39:12,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-09 12:39:12,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 12:39:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 92 transitions. [2025-01-09 12:39:12,243 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 92 transitions. Word has length 97 [2025-01-09 12:39:12,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:12,243 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 92 transitions. [2025-01-09 12:39:12,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 12:39:12,244 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 92 transitions. [2025-01-09 12:39:12,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 12:39:12,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:12,247 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:39:12,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:39:12,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:39:12,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:12,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:12,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1870587030, now seen corresponding path program 1 times [2025-01-09 12:39:12,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:12,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421087382] [2025-01-09 12:39:12,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:12,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:12,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 12:39:12,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 12:39:12,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:12,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:12,864 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 12:39:12,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:12,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421087382] [2025-01-09 12:39:12,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421087382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:12,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:12,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:39:12,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763086120] [2025-01-09 12:39:12,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:12,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:39:12,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:12,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:39:12,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:39:12,867 INFO L87 Difference]: Start difference. First operand 62 states and 92 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:39:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:13,034 INFO L93 Difference]: Finished difference Result 180 states and 270 transitions. [2025-01-09 12:39:13,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:39:13,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2025-01-09 12:39:13,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:13,036 INFO L225 Difference]: With dead ends: 180 [2025-01-09 12:39:13,036 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 12:39:13,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-01-09 12:39:13,038 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 56 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:13,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 141 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:39:13,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 12:39:13,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2025-01-09 12:39:13,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 12:39:13,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2025-01-09 12:39:13,055 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 97 [2025-01-09 12:39:13,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:13,055 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2025-01-09 12:39:13,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:39:13,056 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2025-01-09 12:39:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 12:39:13,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:13,057 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:39:13,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:39:13,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:13,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:13,059 INFO L85 PathProgramCache]: Analyzing trace with hash -526601106, now seen corresponding path program 1 times [2025-01-09 12:39:13,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:13,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190837412] [2025-01-09 12:39:13,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:13,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:13,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 12:39:13,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 12:39:13,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:13,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 12:39:13,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:13,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190837412] [2025-01-09 12:39:13,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190837412] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:39:13,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512639834] [2025-01-09 12:39:13,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:13,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:39:13,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:39:13,692 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:39:13,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:39:13,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 12:39:13,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 12:39:13,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:13,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:13,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 12:39:13,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:39:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:39:14,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:39:14,695 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 12:39:14,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512639834] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:39:14,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:39:14,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2025-01-09 12:39:14,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832223381] [2025-01-09 12:39:14,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:39:14,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 12:39:14,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:14,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 12:39:14,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2025-01-09 12:39:14,699 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) [2025-01-09 12:39:15,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:15,978 INFO L93 Difference]: Finished difference Result 378 states and 545 transitions. [2025-01-09 12:39:15,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 12:39:15,979 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) Word has length 98 [2025-01-09 12:39:15,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:15,981 INFO L225 Difference]: With dead ends: 378 [2025-01-09 12:39:15,981 INFO L226 Difference]: Without dead ends: 263 [2025-01-09 12:39:15,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 12:39:15,983 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 319 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:15,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 577 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 12:39:15,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-09 12:39:16,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 253. [2025-01-09 12:39:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 188 states have (on average 1.2234042553191489) internal successors, (230), 188 states have internal predecessors, (230), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:39:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 342 transitions. [2025-01-09 12:39:16,021 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 342 transitions. Word has length 98 [2025-01-09 12:39:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:16,022 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 342 transitions. [2025-01-09 12:39:16,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) [2025-01-09 12:39:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 342 transitions. [2025-01-09 12:39:16,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 12:39:16,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:16,024 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:39:16,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 12:39:16,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:39:16,225 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:16,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:16,226 INFO L85 PathProgramCache]: Analyzing trace with hash 996329483, now seen corresponding path program 1 times [2025-01-09 12:39:16,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:16,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981700051] [2025-01-09 12:39:16,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:16,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:16,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 12:39:16,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 12:39:16,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:16,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 12:39:19,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:19,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981700051] [2025-01-09 12:39:19,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981700051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:19,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:19,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 12:39:19,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209065401] [2025-01-09 12:39:19,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:19,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 12:39:19,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:19,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 12:39:19,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:39:19,118 INFO L87 Difference]: Start difference. First operand 253 states and 342 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:39:21,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:21,184 INFO L93 Difference]: Finished difference Result 664 states and 877 transitions. [2025-01-09 12:39:21,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 12:39:21,185 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2025-01-09 12:39:21,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:21,187 INFO L225 Difference]: With dead ends: 664 [2025-01-09 12:39:21,188 INFO L226 Difference]: Without dead ends: 414 [2025-01-09 12:39:21,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2025-01-09 12:39:21,190 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 464 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:21,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 510 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 12:39:21,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-01-09 12:39:21,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 265. [2025-01-09 12:39:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 200 states have (on average 1.215) internal successors, (243), 200 states have internal predecessors, (243), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:39:21,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 355 transitions. [2025-01-09 12:39:21,239 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 355 transitions. Word has length 99 [2025-01-09 12:39:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:21,240 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 355 transitions. [2025-01-09 12:39:21,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:39:21,240 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 355 transitions. [2025-01-09 12:39:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 12:39:21,245 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:21,245 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:39:21,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:39:21,246 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:21,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:21,246 INFO L85 PathProgramCache]: Analyzing trace with hash -24738871, now seen corresponding path program 1 times [2025-01-09 12:39:21,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:21,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574366245] [2025-01-09 12:39:21,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:21,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:21,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 12:39:21,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 12:39:21,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:21,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 12:39:23,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:23,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574366245] [2025-01-09 12:39:23,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574366245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:23,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:23,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 12:39:23,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674578628] [2025-01-09 12:39:23,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:23,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 12:39:23,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:23,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 12:39:23,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:39:23,793 INFO L87 Difference]: Start difference. First operand 265 states and 355 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:39:26,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:26,178 INFO L93 Difference]: Finished difference Result 484 states and 624 transitions. [2025-01-09 12:39:26,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 12:39:26,179 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2025-01-09 12:39:26,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:26,183 INFO L225 Difference]: With dead ends: 484 [2025-01-09 12:39:26,183 INFO L226 Difference]: Without dead ends: 419 [2025-01-09 12:39:26,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2025-01-09 12:39:26,184 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 359 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:26,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 596 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 12:39:26,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-01-09 12:39:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 265. [2025-01-09 12:39:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 200 states have (on average 1.215) internal successors, (243), 200 states have internal predecessors, (243), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:39:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 355 transitions. [2025-01-09 12:39:26,220 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 355 transitions. Word has length 99 [2025-01-09 12:39:26,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:26,221 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 355 transitions. [2025-01-09 12:39:26,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:39:26,222 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 355 transitions. [2025-01-09 12:39:26,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 12:39:26,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:26,223 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:39:26,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:39:26,225 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:26,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:26,225 INFO L85 PathProgramCache]: Analyzing trace with hash -529834767, now seen corresponding path program 1 times [2025-01-09 12:39:26,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:26,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105485721] [2025-01-09 12:39:26,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:26,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:26,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 12:39:26,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 12:39:26,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:26,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 12:39:26,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:26,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105485721] [2025-01-09 12:39:26,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105485721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:26,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:26,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:39:26,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092454827] [2025-01-09 12:39:26,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:26,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:39:26,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:26,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:39:26,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:39:26,324 INFO L87 Difference]: Start difference. First operand 265 states and 355 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:39:26,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:26,352 INFO L93 Difference]: Finished difference Result 532 states and 717 transitions. [2025-01-09 12:39:26,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:39:26,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 100 [2025-01-09 12:39:26,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:26,356 INFO L225 Difference]: With dead ends: 532 [2025-01-09 12:39:26,357 INFO L226 Difference]: Without dead ends: 270 [2025-01-09 12:39:26,358 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-01-09 12:39:26,359 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 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-01-09 12:39:26,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:39:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-01-09 12:39:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2025-01-09 12:39:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 203 states have (on average 1.2118226600985222) internal successors, (246), 203 states have internal predecessors, (246), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:39:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 358 transitions. [2025-01-09 12:39:26,388 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 358 transitions. Word has length 100 [2025-01-09 12:39:26,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:26,389 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 358 transitions. [2025-01-09 12:39:26,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:39:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 358 transitions. [2025-01-09 12:39:26,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 12:39:26,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:26,390 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:39:26,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:39:26,390 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:26,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:26,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1139225594, now seen corresponding path program 1 times [2025-01-09 12:39:26,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:26,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060176596] [2025-01-09 12:39:26,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:26,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:26,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 12:39:26,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 12:39:26,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:26,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 12:39:26,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:26,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060176596] [2025-01-09 12:39:26,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060176596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:26,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:26,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 12:39:26,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752824089] [2025-01-09 12:39:26,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:26,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:39:26,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:26,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:39:26,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:39:26,885 INFO L87 Difference]: Start difference. First operand 268 states and 358 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:39:27,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:27,045 INFO L93 Difference]: Finished difference Result 332 states and 432 transitions. [2025-01-09 12:39:27,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 12:39:27,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 101 [2025-01-09 12:39:27,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:27,048 INFO L225 Difference]: With dead ends: 332 [2025-01-09 12:39:27,048 INFO L226 Difference]: Without dead ends: 330 [2025-01-09 12:39:27,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:39:27,049 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 25 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:27,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 334 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:39:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-01-09 12:39:27,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 314. [2025-01-09 12:39:27,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 249 states have (on average 1.2048192771084338) internal successors, (300), 249 states have internal predecessors, (300), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:39:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 412 transitions. [2025-01-09 12:39:27,081 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 412 transitions. Word has length 101 [2025-01-09 12:39:27,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:27,081 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 412 transitions. [2025-01-09 12:39:27,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:39:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 412 transitions. [2025-01-09 12:39:27,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 12:39:27,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:27,083 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:39:27,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:39:27,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:27,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:27,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1351864600, now seen corresponding path program 1 times [2025-01-09 12:39:27,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:27,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808810355] [2025-01-09 12:39:27,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:27,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:27,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 12:39:27,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 12:39:27,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:27,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 12:39:27,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:27,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808810355] [2025-01-09 12:39:27,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808810355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:27,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:27,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:39:27,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909331645] [2025-01-09 12:39:27,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:27,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:39:27,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:27,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:39:27,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:39:27,130 INFO L87 Difference]: Start difference. First operand 314 states and 412 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:39:27,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:27,205 INFO L93 Difference]: Finished difference Result 533 states and 706 transitions. [2025-01-09 12:39:27,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:39:27,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 101 [2025-01-09 12:39:27,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:27,208 INFO L225 Difference]: With dead ends: 533 [2025-01-09 12:39:27,208 INFO L226 Difference]: Without dead ends: 365 [2025-01-09 12:39:27,209 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-01-09 12:39:27,209 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 71 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:27,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 125 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:39:27,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-01-09 12:39:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 213. [2025-01-09 12:39:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 164 states have (on average 1.1890243902439024) internal successors, (195), 164 states have internal predecessors, (195), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 12:39:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 279 transitions. [2025-01-09 12:39:27,237 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 279 transitions. Word has length 101 [2025-01-09 12:39:27,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:27,237 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 279 transitions. [2025-01-09 12:39:27,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:39:27,237 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 279 transitions. [2025-01-09 12:39:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 12:39:27,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:27,239 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:39:27,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:39:27,239 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:27,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:27,240 INFO L85 PathProgramCache]: Analyzing trace with hash -611546354, now seen corresponding path program 1 times [2025-01-09 12:39:27,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:27,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059755124] [2025-01-09 12:39:27,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:27,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:27,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 12:39:27,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 12:39:27,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:27,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:27,282 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 12:39:27,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:27,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059755124] [2025-01-09 12:39:27,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059755124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:27,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:27,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:39:27,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105031099] [2025-01-09 12:39:27,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:27,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:39:27,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:27,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:39:27,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:39:27,285 INFO L87 Difference]: Start difference. First operand 213 states and 279 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:39:27,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:27,359 INFO L93 Difference]: Finished difference Result 358 states and 468 transitions. [2025-01-09 12:39:27,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:39:27,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 102 [2025-01-09 12:39:27,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:27,363 INFO L225 Difference]: With dead ends: 358 [2025-01-09 12:39:27,363 INFO L226 Difference]: Without dead ends: 220 [2025-01-09 12:39:27,363 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-01-09 12:39:27,364 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 57 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:27,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 180 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:39:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-01-09 12:39:27,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2025-01-09 12:39:27,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 168 states have (on average 1.1666666666666667) internal successors, (196), 168 states have internal predecessors, (196), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 12:39:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 280 transitions. [2025-01-09 12:39:27,388 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 280 transitions. Word has length 102 [2025-01-09 12:39:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:27,389 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 280 transitions. [2025-01-09 12:39:27,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:39:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 280 transitions. [2025-01-09 12:39:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 12:39:27,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:27,390 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:39:27,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:39:27,390 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:27,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:27,391 INFO L85 PathProgramCache]: Analyzing trace with hash -98742983, now seen corresponding path program 1 times [2025-01-09 12:39:27,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:27,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978072043] [2025-01-09 12:39:27,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:27,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:27,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 12:39:27,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 12:39:27,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:27,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:28,074 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 12:39:28,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:28,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978072043] [2025-01-09 12:39:28,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978072043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:28,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:28,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 12:39:28,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361114266] [2025-01-09 12:39:28,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:28,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:39:28,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:28,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:39:28,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:39:28,076 INFO L87 Difference]: Start difference. First operand 217 states and 280 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:39:28,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:28,361 INFO L93 Difference]: Finished difference Result 530 states and 678 transitions. [2025-01-09 12:39:28,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:39:28,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 103 [2025-01-09 12:39:28,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:28,366 INFO L225 Difference]: With dead ends: 530 [2025-01-09 12:39:28,367 INFO L226 Difference]: Without dead ends: 383 [2025-01-09 12:39:28,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:39:28,369 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 69 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:28,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 266 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:39:28,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-01-09 12:39:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 359. [2025-01-09 12:39:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 278 states have (on average 1.1618705035971224) internal successors, (323), 278 states have internal predecessors, (323), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 12:39:28,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 463 transitions. [2025-01-09 12:39:28,409 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 463 transitions. Word has length 103 [2025-01-09 12:39:28,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:28,410 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 463 transitions. [2025-01-09 12:39:28,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:39:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 463 transitions. [2025-01-09 12:39:28,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 12:39:28,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:28,411 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:39:28,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:39:28,412 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:28,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:28,412 INFO L85 PathProgramCache]: Analyzing trace with hash 765844241, now seen corresponding path program 1 times [2025-01-09 12:39:28,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:28,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676647555] [2025-01-09 12:39:28,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:28,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:28,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 12:39:28,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 12:39:28,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:28,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:28,852 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 12:39:28,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:39:28,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676647555] [2025-01-09 12:39:28,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676647555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:28,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:28,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:39:28,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135986108] [2025-01-09 12:39:28,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:28,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:39:28,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:39:28,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:39:28,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:39:28,855 INFO L87 Difference]: Start difference. First operand 359 states and 463 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:39:29,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:29,131 INFO L93 Difference]: Finished difference Result 546 states and 693 transitions. [2025-01-09 12:39:29,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:39:29,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 104 [2025-01-09 12:39:29,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:29,135 INFO L225 Difference]: With dead ends: 546 [2025-01-09 12:39:29,135 INFO L226 Difference]: Without dead ends: 399 [2025-01-09 12:39:29,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:39:29,137 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 90 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:29,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 341 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:39:29,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-01-09 12:39:29,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 213. [2025-01-09 12:39:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 164 states have (on average 1.146341463414634) internal successors, (188), 164 states have internal predecessors, (188), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 12:39:29,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 272 transitions. [2025-01-09 12:39:29,165 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 272 transitions. Word has length 104 [2025-01-09 12:39:29,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:29,165 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 272 transitions. [2025-01-09 12:39:29,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:39:29,166 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 272 transitions. [2025-01-09 12:39:29,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 12:39:29,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:29,167 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:39:29,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 12:39:29,167 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:29,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:29,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1085884650, now seen corresponding path program 1 times [2025-01-09 12:39:29,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:39:29,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904677451] [2025-01-09 12:39:29,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:29,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:39:29,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 12:39:29,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 12:39:29,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:29,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:39:29,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1686283112] [2025-01-09 12:39:29,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:29,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:39:29,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:39:29,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:39:29,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 12:39:29,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 12:39:29,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 12:39:29,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:29,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:39:29,348 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:39:29,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 12:39:29,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 12:39:29,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:29,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:39:29,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:39:29,442 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:39:29,443 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:39:29,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 12:39:29,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:39:29,648 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:39:29,714 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:39:29,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:39:29 BoogieIcfgContainer [2025-01-09 12:39:29,720 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:39:29,721 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:39:29,721 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:39:29,721 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:39:29,722 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:39:11" (3/4) ... [2025-01-09 12:39:29,724 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:39:29,725 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:39:29,725 INFO L158 Benchmark]: Toolchain (without parser) took 18968.74ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 132.1MB in the beginning and 106.0MB in the end (delta: 26.1MB). Peak memory consumption was 190.0MB. Max. memory is 16.1GB. [2025-01-09 12:39:29,726 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:39:29,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.54ms. Allocated memory is still 167.8MB. Free memory was 131.7MB in the beginning and 119.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:39:29,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.24ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 116.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:39:29,726 INFO L158 Benchmark]: Boogie Preprocessor took 66.16ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 113.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:39:29,727 INFO L158 Benchmark]: RCFGBuilder took 480.57ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 92.1MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 12:39:29,727 INFO L158 Benchmark]: TraceAbstraction took 18081.54ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 91.2MB in the beginning and 106.1MB in the end (delta: -14.8MB). Peak memory consumption was 148.1MB. Max. memory is 16.1GB. [2025-01-09 12:39:29,727 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 335.5MB. Free memory was 106.1MB in the beginning and 106.0MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:39:29,729 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.54ms. Allocated memory is still 167.8MB. Free memory was 131.7MB in the beginning and 119.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.24ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 116.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.16ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 113.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 480.57ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 92.1MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18081.54ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 91.2MB in the beginning and 106.1MB in the end (delta: -14.8MB). Peak memory consumption was 148.1MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 335.5MB. Free memory was 106.1MB in the beginning and 106.0MB in the end (delta: 106.2kB). 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: 19]: 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 to_int at line 60, overapproximation of to_int at line 91, overapproximation of bitwiseOr at line 54, overapproximation of bitwiseOr at line 91, overapproximation of bitwiseAnd at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 99; [L23] signed short int var_1_7 = 18477; [L24] signed short int var_1_8 = 5; [L25] signed long int var_1_9 = 5; [L26] signed long int var_1_10 = 0; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 256; [L31] unsigned char var_1_15 = 0; [L32] unsigned char last_1_var_1_11 = 16; [L33] unsigned long int last_1_var_1_14 = 256; VAL [isInitial=0, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=18477, var_1_8=5, var_1_9=5] [L95] isInitial = 1 [L96] FCALL initially() [L98] CALL updateLastVariables() [L87] last_1_var_1_11 = var_1_11 [L88] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=18477, var_1_8=5, var_1_9=5] [L98] RET updateLastVariables() [L99] CALL updateVariables() [L64] var_1_7 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L65] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L66] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L66] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L67] var_1_8 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L69] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L69] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L70] var_1_9 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L71] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L72] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L73] var_1_10 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L74] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L75] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L76] var_1_12 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L77] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L78] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L79] var_1_13 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L80] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L81] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L82] var_1_15 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L83] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L84] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L99] RET updateVariables() [L100] CALL step() [L37] signed short int stepLocal_3 = var_1_8; [L38] unsigned long int stepLocal_2 = last_1_var_1_14; VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, stepLocal_3=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L39] COND FALSE !(last_1_var_1_14 > stepLocal_3) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L46] EXPR var_1_11 & var_1_7 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L46] COND FALSE !((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) [L51] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L53] unsigned char stepLocal_1 = var_1_11; VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L54] EXPR var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L54] unsigned long int stepLocal_0 = var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))); [L55] COND FALSE !(stepLocal_0 != var_1_11) [L60] var_1_1 = 10.5f VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_7=16383, var_1_8=256, var_1_9=0] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_7=16383, var_1_8=256, var_1_9=0] [L91] EXPR ((((var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14)))) != var_1_11) ? ((var_1_11 == (var_1_11 - (var_1_7 - var_1_11))) ? (var_1_1 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1) : (var_1_1 == ((signed long int) 10.5f))) && ((last_1_var_1_14 > var_1_8) ? ((((last_1_var_1_11 - var_1_8) + var_1_7) > last_1_var_1_14) ? (var_1_11 == ((unsigned char) ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) : (var_1_11 == ((unsigned char) var_1_12))) : 1)) && (((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) ? ((var_1_15 && (var_1_9 > var_1_10)) ? (var_1_14 == ((unsigned long int) var_1_7)) : 1) : (var_1_14 == ((unsigned long int) var_1_7))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=19, var_1_7=16383, var_1_8=256, var_1_9=0] [L91-L92] return ((((var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14)))) != var_1_11) ? ((var_1_11 == (var_1_11 - (var_1_7 - var_1_11))) ? (var_1_1 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1) : (var_1_1 == ((signed long int) 10.5f))) && ((last_1_var_1_14 > var_1_8) ? ((((last_1_var_1_11 - var_1_8) + var_1_7) > last_1_var_1_14) ? (var_1_11 == ((unsigned char) ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) : (var_1_11 == ((unsigned char) var_1_12))) : 1)) && (((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) ? ((var_1_15 && (var_1_9 > var_1_10)) ? (var_1_14 == ((unsigned long int) var_1_7)) : 1) : (var_1_14 == ((unsigned long int) var_1_7))) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=19, var_1_7=16383, var_1_8=256, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=19, var_1_7=16383, var_1_8=256, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.9s, OverallIterations: 12, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1510 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1510 mSDsluCounter, 3325 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2325 mSDsCounter, 248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3917 IncrementalHoareTripleChecker+Invalid, 4165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 248 mSolverCounterUnsat, 1000 mSDtfsCounter, 3917 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 316 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=359occurred in iteration=10, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 699 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 1506 NumberOfCodeBlocks, 1506 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1380 ConstructedInterpolants, 0 QuantifiedInterpolants, 6325 SizeOfPredicates, 4 NumberOfNonLiveVariables, 467 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 4953/5096 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 12:39:29,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a09075700c0165e7f87ec4195e4b424ce35f231e25baba100aa11fb885230d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:39:32,018 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:39:32,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:39:32,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:39:32,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:39:32,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:39:32,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:39:32,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:39:32,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:39:32,175 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:39:32,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:39:32,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:39:32,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:39:32,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:39:32,177 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:39:32,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:39:32,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:39:32,178 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:39:32,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:39:32,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:39:32,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:39:32,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:39:32,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:39:32,178 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:39:32,178 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:39:32,179 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:39:32,179 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:39:32,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:39:32,179 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:39:32,179 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:39:32,179 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:39:32,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:39:32,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:39:32,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:39:32,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:39:32,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:39:32,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:39:32,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:39:32,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:39:32,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:39:32,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:39:32,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:39:32,181 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:39:32,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:39:32,181 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:39:32,182 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:39:32,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:39:32,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:39:32,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:39:32,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:39:32,182 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6a09075700c0165e7f87ec4195e4b424ce35f231e25baba100aa11fb885230d3 [2025-01-09 12:39:32,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:39:32,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:39:32,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:39:32,479 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:39:32,479 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:39:32,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i [2025-01-09 12:39:33,847 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f25bb086e/64dd004bd8284e0fac9a06225b80c77e/FLAGc5c537bd2 [2025-01-09 12:39:34,049 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:39:34,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i [2025-01-09 12:39:34,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f25bb086e/64dd004bd8284e0fac9a06225b80c77e/FLAGc5c537bd2 [2025-01-09 12:39:34,078 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f25bb086e/64dd004bd8284e0fac9a06225b80c77e [2025-01-09 12:39:34,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:39:34,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:39:34,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:39:34,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:39:34,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:39:34,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e58ac99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34, skipping insertion in model container [2025-01-09 12:39:34,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:39:34,240 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i[916,929] [2025-01-09 12:39:34,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:39:34,303 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:39:34,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i[916,929] [2025-01-09 12:39:34,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:39:34,359 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:39:34,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34 WrapperNode [2025-01-09 12:39:34,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:39:34,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:39:34,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:39:34,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:39:34,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,380 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,406 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2025-01-09 12:39:34,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:39:34,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:39:34,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:39:34,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:39:34,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,435 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:39:34,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,444 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,444 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:39:34,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:39:34,461 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:39:34,461 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:39:34,462 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (1/1) ... [2025-01-09 12:39:34,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:39:34,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:39:34,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:39:34,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:39:34,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:39:34,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:39:34,524 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:39:34,524 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:39:34,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:39:34,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:39:34,600 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:39:34,602 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:39:34,889 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 12:39:34,889 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:39:34,900 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:39:34,900 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:39:34,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:39:34 BoogieIcfgContainer [2025-01-09 12:39:34,901 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:39:34,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:39:34,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:39:34,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:39:34,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:39:34" (1/3) ... [2025-01-09 12:39:34,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74323ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:39:34, skipping insertion in model container [2025-01-09 12:39:34,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:39:34" (2/3) ... [2025-01-09 12:39:34,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74323ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:39:34, skipping insertion in model container [2025-01-09 12:39:34,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:39:34" (3/3) ... [2025-01-09 12:39:34,911 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-18.i [2025-01-09 12:39:34,923 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:39:34,925 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-18.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:39:34,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:39:34,985 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;@7cc52393, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:39:34,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:39:34,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 12:39:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 12:39:34,994 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:34,995 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:39:34,995 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:34,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:34,999 INFO L85 PathProgramCache]: Analyzing trace with hash 283549003, now seen corresponding path program 1 times [2025-01-09 12:39:35,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:39:35,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749810529] [2025-01-09 12:39:35,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:35,008 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-01-09 12:39:35,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:39:35,012 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 12:39:35,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:39:35,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 12:39:35,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 12:39:35,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:35,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:35,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:39:35,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:39:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-01-09 12:39:35,202 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:39:35,202 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:39:35,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749810529] [2025-01-09 12:39:35,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749810529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:39:35,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:39:35,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:39:35,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803162109] [2025-01-09 12:39:35,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:39:35,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:39:35,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:39:35,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:39:35,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:39:35,228 INFO L87 Difference]: Start difference. First operand has 46 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 12:39:35,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:35,250 INFO L93 Difference]: Finished difference Result 86 states and 143 transitions. [2025-01-09 12:39:35,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:39:35,251 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 90 [2025-01-09 12:39:35,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:35,255 INFO L225 Difference]: With dead ends: 86 [2025-01-09 12:39:35,256 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 12:39:35,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:39:35,260 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:35,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:39:35,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 12:39:35,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-01-09 12:39:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 12:39:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 62 transitions. [2025-01-09 12:39:35,293 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 62 transitions. Word has length 90 [2025-01-09 12:39:35,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:35,295 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 62 transitions. [2025-01-09 12:39:35,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 12:39:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 62 transitions. [2025-01-09 12:39:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 12:39:35,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:35,323 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:39:35,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:39:35,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 12:39:35,529 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:35,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:35,530 INFO L85 PathProgramCache]: Analyzing trace with hash 283364363, now seen corresponding path program 1 times [2025-01-09 12:39:35,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:39:35,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155141174] [2025-01-09 12:39:35,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:35,531 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-01-09 12:39:35,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:39:35,533 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 12:39:35,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:39:35,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 12:39:35,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 12:39:35,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:35,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:35,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 12:39:35,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:39:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:39:36,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:39:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 12:39:36,759 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:39:36,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155141174] [2025-01-09 12:39:36,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [155141174] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:39:36,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:39:36,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-01-09 12:39:36,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566994985] [2025-01-09 12:39:36,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 12:39:36,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 12:39:36,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:39:36,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 12:39:36,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:39:36,765 INFO L87 Difference]: Start difference. First operand 43 states and 62 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-01-09 12:39:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:39:38,158 INFO L93 Difference]: Finished difference Result 223 states and 314 transitions. [2025-01-09 12:39:38,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 12:39:38,159 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 90 [2025-01-09 12:39:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:39:38,162 INFO L225 Difference]: With dead ends: 223 [2025-01-09 12:39:38,162 INFO L226 Difference]: Without dead ends: 183 [2025-01-09 12:39:38,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=494, Unknown=0, NotChecked=0, Total=756 [2025-01-09 12:39:38,167 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 149 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:39:38,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 256 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 12:39:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-09 12:39:38,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 92. [2025-01-09 12:39:38,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 12:39:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2025-01-09 12:39:38,215 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 90 [2025-01-09 12:39:38,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:39:38,215 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2025-01-09 12:39:38,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-01-09 12:39:38,215 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2025-01-09 12:39:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 12:39:38,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:39:38,217 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:39:38,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:39:38,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-01-09 12:39:38,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:39:38,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:39:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash -39352602, now seen corresponding path program 1 times [2025-01-09 12:39:38,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:39:38,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040819007] [2025-01-09 12:39:38,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:39:38,424 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-01-09 12:39:38,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:39:38,426 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-01-09 12:39:38,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:39:38,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 12:39:38,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 12:39:38,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:39:38,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:39:38,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 12:39:38,530 INFO L279 TraceCheckSpWp]: Computing forward predicates...