./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.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-70.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 6cc35d6f5b3d5004e97f7480a41f6aacae9190a53086f4ffe9263637987416cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:45:15,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:45:15,506 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:45:15,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:45:15,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:45:15,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:45:15,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:45:15,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:45:15,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:45:15,537 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:45:15,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:45:15,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:45:15,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:45:15,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:45:15,538 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:45:15,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:45:15,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:45:15,538 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:45:15,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:45:15,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:45:15,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:45:15,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:45:15,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:45:15,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:45:15,538 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:45:15,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:45:15,538 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:45:15,538 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:45:15,539 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:45:15,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:45:15,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:45:15,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:45:15,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:45:15,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:45:15,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:45:15,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:45:15,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:45:15,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:45:15,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:45:15,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:45:15,539 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:45:15,539 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:45:15,539 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:45:15,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:45:15,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:45:15,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:45:15,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:45:15,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:45:15,541 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 -> 6cc35d6f5b3d5004e97f7480a41f6aacae9190a53086f4ffe9263637987416cc [2025-01-09 12:45:15,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:45:15,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:45:15,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:45:15,758 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:45:15,758 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:45:15,759 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-70.i [2025-01-09 12:45:16,871 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa6cb5e21/5d52b4822e7f439187439cb5ff7db4ea/FLAG7d4e9f545 [2025-01-09 12:45:17,122 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:45:17,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i [2025-01-09 12:45:17,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa6cb5e21/5d52b4822e7f439187439cb5ff7db4ea/FLAG7d4e9f545 [2025-01-09 12:45:17,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa6cb5e21/5d52b4822e7f439187439cb5ff7db4ea [2025-01-09 12:45:17,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:45:17,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:45:17,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:45:17,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:45:17,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:45:17,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:45:17" (1/1) ... [2025-01-09 12:45:17,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ceba2bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:17, skipping insertion in model container [2025-01-09 12:45:17,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:45:17" (1/1) ... [2025-01-09 12:45:17,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:45:17,260 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-70.i[916,929] [2025-01-09 12:45:17,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:45:17,301 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:45:17,315 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-70.i[916,929] [2025-01-09 12:45:17,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:45:17,355 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:45:17,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:17 WrapperNode [2025-01-09 12:45:17,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:45:17,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:45:17,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:45:17,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:45:17,362 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:45:17" (1/1) ... [2025-01-09 12:45:17,366 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:45:17" (1/1) ... [2025-01-09 12:45:17,383 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-01-09 12:45:17,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:45:17,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:45:17,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:45:17,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:45:17,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:17" (1/1) ... [2025-01-09 12:45:17,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:17" (1/1) ... [2025-01-09 12:45:17,392 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:17" (1/1) ... [2025-01-09 12:45:17,402 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:45:17,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:17" (1/1) ... [2025-01-09 12:45:17,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:17" (1/1) ... [2025-01-09 12:45:17,405 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:17" (1/1) ... [2025-01-09 12:45:17,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:17" (1/1) ... [2025-01-09 12:45:17,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:17" (1/1) ... [2025-01-09 12:45:17,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:17" (1/1) ... [2025-01-09 12:45:17,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:17" (1/1) ... [2025-01-09 12:45:17,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:45:17,420 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:45:17,420 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:45:17,420 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:45:17,421 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:17" (1/1) ... [2025-01-09 12:45:17,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:45:17,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:45:17,455 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:45:17,459 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:45:17,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:45:17,475 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:45:17,475 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:45:17,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:45:17,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:45:17,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:45:17,530 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:45:17,531 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:45:17,753 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 12:45:17,753 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:45:17,762 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:45:17,762 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:45:17,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:45:17 BoogieIcfgContainer [2025-01-09 12:45:17,762 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:45:17,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:45:17,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:45:17,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:45:17,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:45:17" (1/3) ... [2025-01-09 12:45:17,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebc6ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:45:17, skipping insertion in model container [2025-01-09 12:45:17,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:17" (2/3) ... [2025-01-09 12:45:17,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebc6ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:45:17, skipping insertion in model container [2025-01-09 12:45:17,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:45:17" (3/3) ... [2025-01-09 12:45:17,768 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-70.i [2025-01-09 12:45:17,777 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:45:17,778 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-70.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:45:17,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:45:17,817 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;@18d2a51d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:45:17,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:45:17,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 12:45:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 12:45:17,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:17,827 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:17,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:17,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:17,831 INFO L85 PathProgramCache]: Analyzing trace with hash 887107627, now seen corresponding path program 1 times [2025-01-09 12:45:17,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:45:17,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499634274] [2025-01-09 12:45:17,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:17,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:45:17,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 12:45:17,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 12:45:17,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:17,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:18,013 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 12:45:18,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:45:18,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499634274] [2025-01-09 12:45:18,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499634274] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:45:18,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294175716] [2025-01-09 12:45:18,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:18,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:45:18,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:45:18,017 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:45:18,019 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:45:18,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 12:45:18,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 12:45:18,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:18,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:18,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:45:18,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:45:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 12:45:18,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:45:18,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294175716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:45:18,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:45:18,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:45:18,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400939766] [2025-01-09 12:45:18,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:45:18,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:45:18,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:45:18,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:45:18,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:45:18,191 INFO L87 Difference]: Start difference. First operand has 63 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 12:45:18,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:18,224 INFO L93 Difference]: Finished difference Result 120 states and 193 transitions. [2025-01-09 12:45:18,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:45:18,226 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2025-01-09 12:45:18,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:18,231 INFO L225 Difference]: With dead ends: 120 [2025-01-09 12:45:18,232 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 12:45:18,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 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:45:18,237 INFO L435 NwaCegarLoop]: 86 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, 86 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:45:18,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:45:18,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 12:45:18,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-09 12:45:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 12:45:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 86 transitions. [2025-01-09 12:45:18,268 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 86 transitions. Word has length 107 [2025-01-09 12:45:18,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:18,269 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 86 transitions. [2025-01-09 12:45:18,269 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 12:45:18,270 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 86 transitions. [2025-01-09 12:45:18,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 12:45:18,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:18,274 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:18,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 12:45:18,474 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:45:18,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:18,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:18,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1343574059, now seen corresponding path program 1 times [2025-01-09 12:45:18,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:45:18,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611216350] [2025-01-09 12:45:18,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:18,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:45:18,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 12:45:18,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 12:45:18,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:18,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 12:45:18,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:45:18,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611216350] [2025-01-09 12:45:18,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611216350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:45:18,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:45:18,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:45:18,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323510760] [2025-01-09 12:45:18,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:45:18,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:45:18,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:45:18,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:45:18,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:45:18,655 INFO L87 Difference]: Start difference. First operand 60 states and 86 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:18,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:18,691 INFO L93 Difference]: Finished difference Result 117 states and 169 transitions. [2025-01-09 12:45:18,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:45:18,692 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2025-01-09 12:45:18,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:18,693 INFO L225 Difference]: With dead ends: 117 [2025-01-09 12:45:18,693 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 12:45:18,693 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:45:18,694 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:45:18,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:45:18,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 12:45:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-09 12:45:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 12:45:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2025-01-09 12:45:18,701 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 107 [2025-01-09 12:45:18,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:18,704 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2025-01-09 12:45:18,705 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2025-01-09 12:45:18,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 12:45:18,708 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:18,709 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:18,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:45:18,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:18,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:18,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1816960796, now seen corresponding path program 1 times [2025-01-09 12:45:18,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:45:18,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85615560] [2025-01-09 12:45:18,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:18,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:45:18,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 12:45:18,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 12:45:18,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:18,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 12:45:19,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:45:19,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85615560] [2025-01-09 12:45:19,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85615560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:45:19,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:45:19,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 12:45:19,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836948392] [2025-01-09 12:45:19,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:45:19,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 12:45:19,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:45:19,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 12:45:19,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:45:19,527 INFO L87 Difference]: Start difference. First operand 60 states and 85 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:19,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:19,917 INFO L93 Difference]: Finished difference Result 193 states and 265 transitions. [2025-01-09 12:45:19,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 12:45:19,917 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2025-01-09 12:45:19,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:19,918 INFO L225 Difference]: With dead ends: 193 [2025-01-09 12:45:19,919 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 12:45:19,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:45:19,919 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 107 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:45:19,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 391 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:45:19,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 12:45:19,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 99. [2025-01-09 12:45:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.294871794871795) internal successors, (101), 79 states have internal predecessors, (101), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:45:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 137 transitions. [2025-01-09 12:45:19,939 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 137 transitions. Word has length 109 [2025-01-09 12:45:19,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:19,939 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 137 transitions. [2025-01-09 12:45:19,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:19,940 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2025-01-09 12:45:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 12:45:19,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:19,942 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:19,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:45:19,942 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:19,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:19,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1136902426, now seen corresponding path program 1 times [2025-01-09 12:45:19,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:45:19,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863633232] [2025-01-09 12:45:19,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:19,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:45:19,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 12:45:19,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 12:45:19,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:19,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:20,860 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 12:45:20,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:45:20,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863633232] [2025-01-09 12:45:20,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863633232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:45:20,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:45:20,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:45:20,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560473084] [2025-01-09 12:45:20,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:45:20,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:45:20,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:45:20,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:45:20,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:45:20,864 INFO L87 Difference]: Start difference. First operand 99 states and 137 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:21,033 INFO L93 Difference]: Finished difference Result 221 states and 302 transitions. [2025-01-09 12:45:21,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:45:21,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2025-01-09 12:45:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:21,036 INFO L225 Difference]: With dead ends: 221 [2025-01-09 12:45:21,037 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 12:45:21,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:45:21,039 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 77 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:45:21,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 191 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:45:21,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 12:45:21,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2025-01-09 12:45:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 86 states have internal predecessors, (110), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:45:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 146 transitions. [2025-01-09 12:45:21,054 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 146 transitions. Word has length 109 [2025-01-09 12:45:21,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:21,054 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 146 transitions. [2025-01-09 12:45:21,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:21,055 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2025-01-09 12:45:21,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 12:45:21,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:21,058 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:21,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:45:21,058 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:21,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:21,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1198142822, now seen corresponding path program 1 times [2025-01-09 12:45:21,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:45:21,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567777681] [2025-01-09 12:45:21,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:21,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:45:21,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 12:45:21,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 12:45:21,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:21,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 12:45:23,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:45:23,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567777681] [2025-01-09 12:45:23,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567777681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:45:23,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:45:23,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:45:23,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832064584] [2025-01-09 12:45:23,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:45:23,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:45:23,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:45:23,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:45:23,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:45:23,603 INFO L87 Difference]: Start difference. First operand 106 states and 146 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:25,032 INFO L93 Difference]: Finished difference Result 249 states and 337 transitions. [2025-01-09 12:45:25,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:45:25,036 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2025-01-09 12:45:25,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:25,037 INFO L225 Difference]: With dead ends: 249 [2025-01-09 12:45:25,037 INFO L226 Difference]: Without dead ends: 146 [2025-01-09 12:45:25,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:45:25,038 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 113 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:45:25,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 424 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:45:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-09 12:45:25,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 108. [2025-01-09 12:45:25,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 88 states have internal predecessors, (113), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:45:25,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 149 transitions. [2025-01-09 12:45:25,047 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 149 transitions. Word has length 109 [2025-01-09 12:45:25,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:25,047 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 149 transitions. [2025-01-09 12:45:25,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 149 transitions. [2025-01-09 12:45:25,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 12:45:25,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:25,049 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:25,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:45:25,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:25,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:25,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1878201192, now seen corresponding path program 1 times [2025-01-09 12:45:25,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:45:25,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585533642] [2025-01-09 12:45:25,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:25,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:45:25,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 12:45:25,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 12:45:25,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:25,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 12:45:25,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:45:25,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585533642] [2025-01-09 12:45:25,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585533642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:45:25,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:45:25,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:45:25,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615691361] [2025-01-09 12:45:25,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:45:25,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:45:25,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:45:25,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:45:25,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:45:25,840 INFO L87 Difference]: Start difference. First operand 108 states and 149 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:26,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:26,078 INFO L93 Difference]: Finished difference Result 217 states and 298 transitions. [2025-01-09 12:45:26,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:45:26,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2025-01-09 12:45:26,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:26,080 INFO L225 Difference]: With dead ends: 217 [2025-01-09 12:45:26,080 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 12:45:26,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:45:26,081 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 25 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:45:26,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 228 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:45:26,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 12:45:26,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 99. [2025-01-09 12:45:26,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 79 states have internal predecessors, (100), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:45:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 136 transitions. [2025-01-09 12:45:26,087 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 136 transitions. Word has length 109 [2025-01-09 12:45:26,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:26,088 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 136 transitions. [2025-01-09 12:45:26,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 136 transitions. [2025-01-09 12:45:26,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 12:45:26,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:26,089 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:26,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:45:26,089 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:26,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:26,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1456938146, now seen corresponding path program 1 times [2025-01-09 12:45:26,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:45:26,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274650358] [2025-01-09 12:45:26,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:26,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:45:26,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 12:45:26,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 12:45:26,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:26,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:26,120 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 12:45:26,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:45:26,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274650358] [2025-01-09 12:45:26,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274650358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:45:26,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:45:26,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:45:26,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327534230] [2025-01-09 12:45:26,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:45:26,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:45:26,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:45:26,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:45:26,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:45:26,123 INFO L87 Difference]: Start difference. First operand 99 states and 136 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:26,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:26,139 INFO L93 Difference]: Finished difference Result 199 states and 272 transitions. [2025-01-09 12:45:26,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:45:26,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2025-01-09 12:45:26,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:26,141 INFO L225 Difference]: With dead ends: 199 [2025-01-09 12:45:26,141 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 12:45:26,141 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:45:26,142 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 37 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:45:26,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 184 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:45:26,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 12:45:26,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2025-01-09 12:45:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 79 states have internal predecessors, (99), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:45:26,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 135 transitions. [2025-01-09 12:45:26,152 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 135 transitions. Word has length 109 [2025-01-09 12:45:26,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:26,153 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 135 transitions. [2025-01-09 12:45:26,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:26,153 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 135 transitions. [2025-01-09 12:45:26,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 12:45:26,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:26,154 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:26,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:45:26,155 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:26,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:26,155 INFO L85 PathProgramCache]: Analyzing trace with hash 177074468, now seen corresponding path program 1 times [2025-01-09 12:45:26,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:45:26,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813848417] [2025-01-09 12:45:26,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:26,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:45:26,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 12:45:26,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 12:45:26,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:26,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:26,247 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 12:45:26,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:45:26,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813848417] [2025-01-09 12:45:26,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813848417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:45:26,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:45:26,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:45:26,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570901843] [2025-01-09 12:45:26,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:45:26,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:45:26,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:45:26,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:45:26,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:45:26,252 INFO L87 Difference]: Start difference. First operand 99 states and 135 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:26,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:26,280 INFO L93 Difference]: Finished difference Result 199 states and 270 transitions. [2025-01-09 12:45:26,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:45:26,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2025-01-09 12:45:26,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:26,281 INFO L225 Difference]: With dead ends: 199 [2025-01-09 12:45:26,281 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 12:45:26,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:45:26,282 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 27 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:45:26,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 294 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:45:26,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 12:45:26,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2025-01-09 12:45:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 79 states have internal predecessors, (98), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:45:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 134 transitions. [2025-01-09 12:45:26,292 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 134 transitions. Word has length 109 [2025-01-09 12:45:26,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:26,292 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 134 transitions. [2025-01-09 12:45:26,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:26,292 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 134 transitions. [2025-01-09 12:45:26,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 12:45:26,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:26,294 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:26,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:45:26,294 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:26,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:26,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1982298913, now seen corresponding path program 1 times [2025-01-09 12:45:26,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:45:26,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45082803] [2025-01-09 12:45:26,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:26,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:45:26,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 12:45:26,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 12:45:26,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:26,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 12:45:26,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:45:26,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45082803] [2025-01-09 12:45:26,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45082803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:45:26,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:45:26,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:45:26,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911989353] [2025-01-09 12:45:26,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:45:26,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:45:26,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:45:26,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:45:26,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:45:26,341 INFO L87 Difference]: Start difference. First operand 99 states and 134 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:26,386 INFO L93 Difference]: Finished difference Result 195 states and 265 transitions. [2025-01-09 12:45:26,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:45:26,386 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2025-01-09 12:45:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:26,388 INFO L225 Difference]: With dead ends: 195 [2025-01-09 12:45:26,388 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 12:45:26,388 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:45:26,388 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:45:26,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:45:26,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 12:45:26,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 12:45:26,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 79 states have internal predecessors, (96), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:45:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 132 transitions. [2025-01-09 12:45:26,395 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 132 transitions. Word has length 112 [2025-01-09 12:45:26,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:26,396 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 132 transitions. [2025-01-09 12:45:26,396 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:26,396 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 132 transitions. [2025-01-09 12:45:26,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 12:45:26,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:26,396 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:26,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:45:26,400 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:26,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:26,400 INFO L85 PathProgramCache]: Analyzing trace with hash -928147112, now seen corresponding path program 1 times [2025-01-09 12:45:26,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:45:26,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852861601] [2025-01-09 12:45:26,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:26,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:45:26,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 12:45:26,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 12:45:26,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:26,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 12:45:27,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:45:27,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852861601] [2025-01-09 12:45:27,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852861601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:45:27,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:45:27,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 12:45:27,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579519385] [2025-01-09 12:45:27,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:45:27,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 12:45:27,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:45:27,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 12:45:27,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:45:27,050 INFO L87 Difference]: Start difference. First operand 99 states and 132 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:27,625 INFO L93 Difference]: Finished difference Result 320 states and 411 transitions. [2025-01-09 12:45:27,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 12:45:27,625 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2025-01-09 12:45:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:27,626 INFO L225 Difference]: With dead ends: 320 [2025-01-09 12:45:27,627 INFO L226 Difference]: Without dead ends: 224 [2025-01-09 12:45:27,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 12:45:27,628 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 285 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:45:27,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 504 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:45:27,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-01-09 12:45:27,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 153. [2025-01-09 12:45:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 118 states have (on average 1.1864406779661016) internal successors, (140), 120 states have internal predecessors, (140), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 12:45:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 200 transitions. [2025-01-09 12:45:27,638 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 200 transitions. Word has length 114 [2025-01-09 12:45:27,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:27,638 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 200 transitions. [2025-01-09 12:45:27,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:27,638 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 200 transitions. [2025-01-09 12:45:27,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 12:45:27,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:27,639 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:27,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:45:27,639 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:27,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:27,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1186312550, now seen corresponding path program 1 times [2025-01-09 12:45:27,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:45:27,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373907825] [2025-01-09 12:45:27,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:27,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:45:27,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 12:45:27,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 12:45:27,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:27,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 12:45:27,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:45:27,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373907825] [2025-01-09 12:45:27,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373907825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:45:27,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:45:27,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:45:27,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509900102] [2025-01-09 12:45:27,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:45:27,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:45:27,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:45:27,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:45:27,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:45:27,701 INFO L87 Difference]: Start difference. First operand 153 states and 200 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:27,735 INFO L93 Difference]: Finished difference Result 277 states and 360 transitions. [2025-01-09 12:45:27,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:45:27,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2025-01-09 12:45:27,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:27,737 INFO L225 Difference]: With dead ends: 277 [2025-01-09 12:45:27,737 INFO L226 Difference]: Without dead ends: 150 [2025-01-09 12:45:27,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:45:27,737 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:45:27,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:45:27,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-09 12:45:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-01-09 12:45:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 115 states have (on average 1.1565217391304348) internal successors, (133), 117 states have internal predecessors, (133), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 12:45:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 193 transitions. [2025-01-09 12:45:27,747 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 193 transitions. Word has length 114 [2025-01-09 12:45:27,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:27,747 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 193 transitions. [2025-01-09 12:45:27,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 193 transitions. [2025-01-09 12:45:27,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 12:45:27,748 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:27,748 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:27,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 12:45:27,748 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:27,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:27,749 INFO L85 PathProgramCache]: Analyzing trace with hash -734678312, now seen corresponding path program 1 times [2025-01-09 12:45:27,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:45:27,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264853182] [2025-01-09 12:45:27,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:27,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:45:27,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 12:45:27,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 12:45:27,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:27,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 12:45:28,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:45:28,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264853182] [2025-01-09 12:45:28,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264853182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:45:28,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:45:28,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 12:45:28,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477691881] [2025-01-09 12:45:28,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:45:28,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 12:45:28,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:45:28,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 12:45:28,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:45:28,781 INFO L87 Difference]: Start difference. First operand 150 states and 193 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:30,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:30,488 INFO L93 Difference]: Finished difference Result 207 states and 257 transitions. [2025-01-09 12:45:30,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 12:45:30,488 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2025-01-09 12:45:30,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:30,490 INFO L225 Difference]: With dead ends: 207 [2025-01-09 12:45:30,490 INFO L226 Difference]: Without dead ends: 205 [2025-01-09 12:45:30,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=229, Invalid=893, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 12:45:30,491 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 234 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:45:30,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 885 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 12:45:30,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-09 12:45:30,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 161. [2025-01-09 12:45:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 126 states have (on average 1.1666666666666667) internal successors, (147), 128 states have internal predecessors, (147), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 12:45:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 207 transitions. [2025-01-09 12:45:30,502 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 207 transitions. Word has length 114 [2025-01-09 12:45:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:30,502 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 207 transitions. [2025-01-09 12:45:30,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 207 transitions. [2025-01-09 12:45:30,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 12:45:30,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:30,503 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:30,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 12:45:30,503 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:30,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:30,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1745795562, now seen corresponding path program 1 times [2025-01-09 12:45:30,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:45:30,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983154871] [2025-01-09 12:45:30,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:30,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:45:30,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 12:45:30,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 12:45:30,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:30,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 12:45:31,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:45:31,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983154871] [2025-01-09 12:45:31,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983154871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:45:31,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:45:31,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 12:45:31,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60242954] [2025-01-09 12:45:31,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:45:31,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 12:45:31,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:45:31,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 12:45:31,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:45:31,030 INFO L87 Difference]: Start difference. First operand 161 states and 207 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:31,524 INFO L93 Difference]: Finished difference Result 238 states and 296 transitions. [2025-01-09 12:45:31,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 12:45:31,524 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2025-01-09 12:45:31,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:31,526 INFO L225 Difference]: With dead ends: 238 [2025-01-09 12:45:31,526 INFO L226 Difference]: Without dead ends: 236 [2025-01-09 12:45:31,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-01-09 12:45:31,527 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 137 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:45:31,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 471 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:45:31,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-01-09 12:45:31,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 179. [2025-01-09 12:45:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 144 states have (on average 1.1875) internal successors, (171), 146 states have internal predecessors, (171), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 12:45:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 231 transitions. [2025-01-09 12:45:31,538 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 231 transitions. Word has length 114 [2025-01-09 12:45:31,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:31,538 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 231 transitions. [2025-01-09 12:45:31,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 231 transitions. [2025-01-09 12:45:31,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 12:45:31,539 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:31,539 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:31,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 12:45:31,540 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:31,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:31,540 INFO L85 PathProgramCache]: Analyzing trace with hash -311976486, now seen corresponding path program 1 times [2025-01-09 12:45:31,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:45:31,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178670911] [2025-01-09 12:45:31,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:31,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:45:31,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 12:45:31,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 12:45:31,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:31,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:32,152 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 12:45:32,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:45:32,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178670911] [2025-01-09 12:45:32,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178670911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:45:32,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:45:32,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 12:45:32,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990617147] [2025-01-09 12:45:32,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:45:32,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 12:45:32,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:45:32,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 12:45:32,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:45:32,155 INFO L87 Difference]: Start difference. First operand 179 states and 231 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:32,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:32,601 INFO L93 Difference]: Finished difference Result 222 states and 279 transitions. [2025-01-09 12:45:32,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 12:45:32,601 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2025-01-09 12:45:32,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:32,605 INFO L225 Difference]: With dead ends: 222 [2025-01-09 12:45:32,605 INFO L226 Difference]: Without dead ends: 220 [2025-01-09 12:45:32,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2025-01-09 12:45:32,605 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 153 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:45:32,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 638 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:45:32,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-01-09 12:45:32,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 179. [2025-01-09 12:45:32,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 144 states have (on average 1.1875) internal successors, (171), 146 states have internal predecessors, (171), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 12:45:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 231 transitions. [2025-01-09 12:45:32,618 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 231 transitions. Word has length 114 [2025-01-09 12:45:32,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:32,619 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 231 transitions. [2025-01-09 12:45:32,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 231 transitions. [2025-01-09 12:45:32,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 12:45:32,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:32,620 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:32,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 12:45:32,620 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:32,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:32,621 INFO L85 PathProgramCache]: Analyzing trace with hash -736007916, now seen corresponding path program 1 times [2025-01-09 12:45:32,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:45:32,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90858663] [2025-01-09 12:45:32,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:32,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:45:32,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 12:45:32,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 12:45:32,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:32,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 12:45:32,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:45:32,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90858663] [2025-01-09 12:45:32,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90858663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:45:32,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:45:32,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:45:32,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032980762] [2025-01-09 12:45:32,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:45:32,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:45:32,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:45:32,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:45:32,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:45:32,664 INFO L87 Difference]: Start difference. First operand 179 states and 231 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:32,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:32,737 INFO L93 Difference]: Finished difference Result 383 states and 492 transitions. [2025-01-09 12:45:32,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:45:32,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2025-01-09 12:45:32,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:32,739 INFO L225 Difference]: With dead ends: 383 [2025-01-09 12:45:32,739 INFO L226 Difference]: Without dead ends: 230 [2025-01-09 12:45:32,740 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:45:32,740 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:45:32,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 173 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:45:32,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-01-09 12:45:32,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 201. [2025-01-09 12:45:32,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 145 states have (on average 1.1310344827586207) internal successors, (164), 149 states have internal predecessors, (164), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 12:45:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 260 transitions. [2025-01-09 12:45:32,762 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 260 transitions. Word has length 115 [2025-01-09 12:45:32,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:32,762 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 260 transitions. [2025-01-09 12:45:32,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:32,763 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 260 transitions. [2025-01-09 12:45:32,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 12:45:32,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:32,763 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:32,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 12:45:32,763 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:32,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:32,764 INFO L85 PathProgramCache]: Analyzing trace with hash -116432204, now seen corresponding path program 1 times [2025-01-09 12:45:32,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:45:32,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557553748] [2025-01-09 12:45:32,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:32,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:45:32,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 12:45:32,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 12:45:32,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:32,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 12:45:32,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:45:32,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557553748] [2025-01-09 12:45:32,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557553748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:45:32,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:45:32,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:45:32,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160531313] [2025-01-09 12:45:32,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:45:32,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:45:32,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:45:32,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:45:32,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:45:32,803 INFO L87 Difference]: Start difference. First operand 201 states and 260 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:32,856 INFO L93 Difference]: Finished difference Result 358 states and 461 transitions. [2025-01-09 12:45:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:45:32,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-01-09 12:45:32,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:32,858 INFO L225 Difference]: With dead ends: 358 [2025-01-09 12:45:32,858 INFO L226 Difference]: Without dead ends: 183 [2025-01-09 12:45:32,861 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:45:32,861 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 60 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:45:32,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:45:32,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-09 12:45:32,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2025-01-09 12:45:32,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 125 states have (on average 1.08) internal successors, (135), 128 states have internal predecessors, (135), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 12:45:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 227 transitions. [2025-01-09 12:45:32,881 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 227 transitions. Word has length 116 [2025-01-09 12:45:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:32,881 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 227 transitions. [2025-01-09 12:45:32,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:32,881 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 227 transitions. [2025-01-09 12:45:32,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 12:45:32,882 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:32,882 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:32,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 12:45:32,882 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:32,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:32,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1875601126, now seen corresponding path program 1 times [2025-01-09 12:45:32,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:45:32,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055097537] [2025-01-09 12:45:32,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:32,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:45:32,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 12:45:32,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 12:45:32,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:32,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 45 proven. 39 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-01-09 12:45:33,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:45:33,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055097537] [2025-01-09 12:45:33,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055097537] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:45:33,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092776118] [2025-01-09 12:45:33,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:33,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:45:33,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:45:33,170 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:45:33,172 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:45:33,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 12:45:33,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 12:45:33,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:33,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:33,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 12:45:33,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:45:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2025-01-09 12:45:33,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:45:33,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092776118] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:45:33,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:45:33,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2025-01-09 12:45:33,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210349389] [2025-01-09 12:45:33,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 12:45:33,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:45:33,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:45:33,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:45:33,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:45:33,988 INFO L87 Difference]: Start difference. First operand 179 states and 227 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-01-09 12:45:34,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:34,573 INFO L93 Difference]: Finished difference Result 393 states and 472 transitions. [2025-01-09 12:45:34,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 12:45:34,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 118 [2025-01-09 12:45:34,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:34,575 INFO L225 Difference]: With dead ends: 393 [2025-01-09 12:45:34,575 INFO L226 Difference]: Without dead ends: 240 [2025-01-09 12:45:34,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2025-01-09 12:45:34,576 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 290 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:45:34,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 152 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:45:34,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-01-09 12:45:34,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 158. [2025-01-09 12:45:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 104 states have (on average 1.0480769230769231) internal successors, (109), 106 states have internal predecessors, (109), 42 states have call successors, (42), 11 states have call predecessors, (42), 11 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 12:45:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 193 transitions. [2025-01-09 12:45:34,595 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 193 transitions. Word has length 118 [2025-01-09 12:45:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:34,596 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 193 transitions. [2025-01-09 12:45:34,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-01-09 12:45:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2025-01-09 12:45:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 12:45:34,596 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:34,597 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:34,605 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:45:34,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 12:45:34,801 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:34,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:34,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2009614632, now seen corresponding path program 1 times [2025-01-09 12:45:34,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:45:34,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434424373] [2025-01-09 12:45:34,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:34,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:45:34,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 12:45:34,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 12:45:34,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:34,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:45:34,820 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:45:34,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 12:45:34,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 12:45:34,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:34,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:45:34,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:45:34,878 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:45:34,879 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:45:34,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 12:45:34,882 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:45:34,946 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:45:34,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:45:34 BoogieIcfgContainer [2025-01-09 12:45:34,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:45:34,950 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:45:34,950 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:45:34,950 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:45:34,951 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:45:17" (3/4) ... [2025-01-09 12:45:34,952 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:45:34,952 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:45:34,953 INFO L158 Benchmark]: Toolchain (without parser) took 17811.95ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 110.4MB in the beginning and 554.9MB in the end (delta: -444.5MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2025-01-09 12:45:34,954 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:45:34,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.03ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 98.0MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:45:34,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.81ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 95.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:45:34,954 INFO L158 Benchmark]: Boogie Preprocessor took 35.72ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 91.7MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:45:34,954 INFO L158 Benchmark]: RCFGBuilder took 342.05ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 73.7MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:45:34,955 INFO L158 Benchmark]: TraceAbstraction took 17185.50ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 72.8MB in the beginning and 555.1MB in the end (delta: -482.3MB). Peak memory consumption was 248.4MB. Max. memory is 16.1GB. [2025-01-09 12:45:34,955 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 595.6MB. Free memory was 555.1MB in the beginning and 554.9MB in the end (delta: 157.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:45:34,956 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.16ms. Allocated memory is still 201.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.03ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 98.0MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.81ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 95.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.72ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 91.7MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 342.05ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 73.7MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17185.50ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 72.8MB in the beginning and 555.1MB in the end (delta: -482.3MB). Peak memory consumption was 248.4MB. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 595.6MB. Free memory was 555.1MB in the beginning and 554.9MB in the end (delta: 157.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 shiftLeft at line 48, overapproximation of shiftLeft at line 89, overapproximation of shiftLeft at line 89, overapproximation of shiftLeft at line 48. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_4 = 19138; [L25] signed char var_1_6 = 25; [L26] signed long int var_1_7 = -50; [L27] signed long int var_1_8 = 8; [L28] signed long int var_1_9 = 255; [L29] signed long int var_1_10 = 10000000; [L30] signed long int var_1_11 = 0; [L31] signed long int var_1_12 = 255; [L32] unsigned char var_1_13 = 50; [L33] unsigned char var_1_14 = 2; [L34] signed char var_1_15 = 1; [L35] signed char var_1_16 = 5; VAL [isInitial=0, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L93] isInitial = 1 [L94] FCALL initially() [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L64] var_1_4 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L65] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L66] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L66] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L67] var_1_9 = __VERIFIER_nondet_long() [L68] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L68] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L69] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L69] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L70] var_1_10 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L71] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L72] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L73] var_1_11 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L74] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L75] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L76] var_1_12 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L77] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L78] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L79] var_1_14 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L80] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=1, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=1, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L81] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=1, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L82] var_1_16 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L83] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L84] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L97] RET updateVariables() [L98] CALL step() [L39] var_1_13 = var_1_14 [L40] var_1_15 = var_1_16 VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_1=47136, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L44] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_1=47136, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L47] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=-35620, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_1=47136, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=-35620, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_1=47136, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=-35620, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_1=47136, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=-35620, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_1=47136, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=-35620, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_1=47136, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] COND TRUE stepLocal_0 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)))) [L49] var_1_7 = (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_1=47136, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=8, var_1_9=0] [L53] unsigned char stepLocal_1 = var_1_13; VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_1=47136, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=8, var_1_9=0] [L54] COND FALSE !(var_1_13 < stepLocal_1) [L57] var_1_8 = ((var_1_11 - var_1_12) - var_1_9) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_1=47136, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_1=47136, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_1=47136, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_1=47136, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_1=47136, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_1=47136, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_1=47136, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89-L90] return (((((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))) && ((var_1_13 < var_1_13) ? (var_1_8 == ((signed long int) (var_1_9 - var_1_10))) : (var_1_8 == ((signed long int) ((var_1_11 - var_1_12) - var_1_9))))) && (var_1_13 == ((unsigned char) var_1_14))) && (var_1_15 == ((signed char) var_1_16)) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_1=47136, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_1=47136, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.1s, OverallIterations: 18, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1608 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1608 mSDsluCounter, 5173 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3714 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4188 IncrementalHoareTripleChecker+Invalid, 4291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 1459 mSDtfsCounter, 4188 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred in iteration=15, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 443 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 2242 NumberOfCodeBlocks, 2242 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2105 ConstructedInterpolants, 0 QuantifiedInterpolants, 8783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 518 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 9015/9120 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:45:34,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-70.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 6cc35d6f5b3d5004e97f7480a41f6aacae9190a53086f4ffe9263637987416cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:45:36,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:45:36,963 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:45:36,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:45:36,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:45:36,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:45:37,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:45:37,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:45:37,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:45:37,001 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:45:37,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:45:37,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:45:37,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:45:37,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:45:37,003 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:45:37,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:45:37,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:45:37,003 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:45:37,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:45:37,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:45:37,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:45:37,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:45:37,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:45:37,004 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:45:37,004 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:45:37,004 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:45:37,004 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:45:37,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:45:37,004 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:45:37,004 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:45:37,005 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:45:37,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:45:37,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:45:37,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:45:37,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:45:37,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:45:37,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:45:37,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:45:37,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:45:37,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:45:37,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:45:37,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:45:37,006 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:45:37,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:45:37,007 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:45:37,007 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:45:37,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:45:37,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:45:37,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:45:37,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:45:37,007 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 -> 6cc35d6f5b3d5004e97f7480a41f6aacae9190a53086f4ffe9263637987416cc [2025-01-09 12:45:37,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:45:37,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:45:37,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:45:37,275 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:45:37,275 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:45:37,276 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-70.i [2025-01-09 12:45:38,528 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b91d0ead/1d710a637ccc48c5843b225832c72c83/FLAGb693f7712 [2025-01-09 12:45:38,704 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:45:38,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i [2025-01-09 12:45:38,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b91d0ead/1d710a637ccc48c5843b225832c72c83/FLAGb693f7712 [2025-01-09 12:45:38,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b91d0ead/1d710a637ccc48c5843b225832c72c83 [2025-01-09 12:45:38,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:45:38,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:45:38,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:45:38,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:45:38,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:45:38,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:45:38" (1/1) ... [2025-01-09 12:45:38,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad6b9ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:38, skipping insertion in model container [2025-01-09 12:45:38,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:45:38" (1/1) ... [2025-01-09 12:45:38,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:45:38,830 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-70.i[916,929] [2025-01-09 12:45:38,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:45:38,884 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:45:38,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i[916,929] [2025-01-09 12:45:38,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:45:38,931 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:45:38,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:38 WrapperNode [2025-01-09 12:45:38,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:45:38,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:45:38,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:45:38,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:45:38,938 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:45:38" (1/1) ... [2025-01-09 12:45:38,946 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:45:38" (1/1) ... [2025-01-09 12:45:38,965 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2025-01-09 12:45:38,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:45:38,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:45:38,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:45:38,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:45:38,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:38" (1/1) ... [2025-01-09 12:45:38,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:38" (1/1) ... [2025-01-09 12:45:38,975 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:38" (1/1) ... [2025-01-09 12:45:38,991 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:45:38,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:38" (1/1) ... [2025-01-09 12:45:38,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:38" (1/1) ... [2025-01-09 12:45:38,998 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:38" (1/1) ... [2025-01-09 12:45:39,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:38" (1/1) ... [2025-01-09 12:45:39,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:38" (1/1) ... [2025-01-09 12:45:39,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:38" (1/1) ... [2025-01-09 12:45:39,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:38" (1/1) ... [2025-01-09 12:45:39,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:45:39,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:45:39,015 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:45:39,015 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:45:39,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:38" (1/1) ... [2025-01-09 12:45:39,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:45:39,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:45:39,042 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:45:39,044 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:45:39,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:45:39,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:45:39,065 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:45:39,065 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:45:39,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:45:39,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:45:39,111 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:45:39,112 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:45:39,222 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 12:45:39,222 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:45:39,228 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:45:39,228 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:45:39,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:45:39 BoogieIcfgContainer [2025-01-09 12:45:39,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:45:39,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:45:39,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:45:39,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:45:39,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:45:38" (1/3) ... [2025-01-09 12:45:39,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bdbb26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:45:39, skipping insertion in model container [2025-01-09 12:45:39,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:45:38" (2/3) ... [2025-01-09 12:45:39,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bdbb26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:45:39, skipping insertion in model container [2025-01-09 12:45:39,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:45:39" (3/3) ... [2025-01-09 12:45:39,236 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-70.i [2025-01-09 12:45:39,245 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:45:39,246 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-70.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:45:39,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:45:39,297 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;@507194f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:45:39,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:45:39,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 12:45:39,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 12:45:39,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:39,307 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:39,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:39,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:39,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1933448576, now seen corresponding path program 1 times [2025-01-09 12:45:39,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:45:39,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2039431861] [2025-01-09 12:45:39,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:39,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:45:39,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:45:39,353 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:45:39,358 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:45:39,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 12:45:39,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 12:45:39,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:39,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:39,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:45:39,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:45:39,498 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 12:45:39,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:45:39,499 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:45:39,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039431861] [2025-01-09 12:45:39,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039431861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:45:39,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:45:39,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:45:39,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588098329] [2025-01-09 12:45:39,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:45:39,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:45:39,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:45:39,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:45:39,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:45:39,515 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 12:45:39,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:39,535 INFO L93 Difference]: Finished difference Result 90 states and 149 transitions. [2025-01-09 12:45:39,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:45:39,537 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2025-01-09 12:45:39,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:39,542 INFO L225 Difference]: With dead ends: 90 [2025-01-09 12:45:39,542 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 12:45:39,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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:45:39,547 INFO L435 NwaCegarLoop]: 64 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, 64 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:45:39,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:45:39,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 12:45:39,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-09 12:45:39,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 12:45:39,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2025-01-09 12:45:39,576 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 103 [2025-01-09 12:45:39,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:39,576 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2025-01-09 12:45:39,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 12:45:39,577 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2025-01-09 12:45:39,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 12:45:39,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:39,579 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:39,586 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:45:39,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:45:39,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:39,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:39,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1241303680, now seen corresponding path program 1 times [2025-01-09 12:45:39,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:45:39,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1510777972] [2025-01-09 12:45:39,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:39,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:45:39,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:45:39,785 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:45:39,787 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:45:39,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 12:45:39,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 12:45:39,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:39,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:39,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 12:45:39,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:45:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 12:45:39,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:45:39,939 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:45:39,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510777972] [2025-01-09 12:45:39,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510777972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:45:39,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:45:39,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:45:39,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889421718] [2025-01-09 12:45:39,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:45:39,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:45:39,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:45:39,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:45:39,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:45:39,940 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:39,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:39,974 INFO L93 Difference]: Finished difference Result 87 states and 125 transitions. [2025-01-09 12:45:39,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:45:39,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-01-09 12:45:39,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:39,978 INFO L225 Difference]: With dead ends: 87 [2025-01-09 12:45:39,978 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 12:45:39,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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:45:39,981 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:45:39,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:45:39,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 12:45:39,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-09 12:45:39,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 12:45:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2025-01-09 12:45:39,991 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 103 [2025-01-09 12:45:39,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:39,991 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2025-01-09 12:45:39,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 12:45:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2025-01-09 12:45:39,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 12:45:39,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:39,993 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:39,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 12:45:40,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:45:40,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:40,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:40,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1239456638, now seen corresponding path program 1 times [2025-01-09 12:45:40,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:45:40,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581696811] [2025-01-09 12:45:40,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:40,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:45:40,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:45:40,200 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:45:40,201 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:45:40,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 12:45:40,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 12:45:40,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:40,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:40,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 12:45:40,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:45:40,640 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 138 proven. 72 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2025-01-09 12:45:40,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:45:40,805 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:45:40,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581696811] [2025-01-09 12:45:40,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581696811] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:45:40,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1031529302] [2025-01-09 12:45:40,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:40,806 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 12:45:40,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 12:45:40,814 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 12:45:40,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-01-09 12:45:40,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 12:45:40,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 12:45:40,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:40,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:40,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 12:45:40,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:45:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 138 proven. 72 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2025-01-09 12:45:41,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:45:41,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1031529302] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:45:41,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:45:41,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-01-09 12:45:41,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708315079] [2025-01-09 12:45:41,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 12:45:41,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:45:41,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:45:41,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:45:41,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:45:41,273 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 12:45:41,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:45:41,658 INFO L93 Difference]: Finished difference Result 119 states and 156 transitions. [2025-01-09 12:45:41,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 12:45:41,659 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 103 [2025-01-09 12:45:41,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:45:41,660 INFO L225 Difference]: With dead ends: 119 [2025-01-09 12:45:41,660 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 12:45:41,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2025-01-09 12:45:41,661 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 43 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:45:41,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 133 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:45:41,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 12:45:41,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2025-01-09 12:45:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.127659574468085) internal successors, (53), 48 states have internal predecessors, (53), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:45:41,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2025-01-09 12:45:41,673 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 103 [2025-01-09 12:45:41,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:45:41,673 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2025-01-09 12:45:41,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 12:45:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2025-01-09 12:45:41,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 12:45:41,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:45:41,674 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:41,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-01-09 12:45:41,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 12:45:42,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:45:42,079 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:45:42,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:45:42,080 INFO L85 PathProgramCache]: Analyzing trace with hash -559398268, now seen corresponding path program 1 times [2025-01-09 12:45:42,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:45:42,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2092453848] [2025-01-09 12:45:42,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:45:42,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:45:42,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:45:42,082 INFO L229 MonitoredProcess]: Starting monitored process 6 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:45:42,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 12:45:42,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 12:45:42,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 12:45:42,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:45:42,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:45:42,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 12:45:42,149 INFO L279 TraceCheckSpWp]: Computing forward predicates...