./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c --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/systemc/mem_slave_tlm.2.cil.c -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 68ec02878969b041c7f7a32af94816f6626efeef23b5da7ea64f6e61f6ff6501 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:15:25,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:15:25,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:15:25,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:15:25,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:15:25,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:15:25,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:15:25,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:15:25,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:15:25,580 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:15:25,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:15:25,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:15:25,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:15:25,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:15:25,581 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:15:25,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:15:25,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:15:25,581 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:15:25,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:15:25,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:15:25,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:15:25,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:15:25,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:15:25,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:15:25,581 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:15:25,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:15:25,582 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:15:25,582 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:15:25,582 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:15:25,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:15:25,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:15:25,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:15:25,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:15:25,582 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:15:25,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:15:25,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:15:25,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:15:25,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:15:25,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:15:25,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:15:25,583 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:15:25,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:15:25,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:15:25,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:15:25,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:15:25,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:15:25,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:15:25,583 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:15:25,583 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 -> 68ec02878969b041c7f7a32af94816f6626efeef23b5da7ea64f6e61f6ff6501 [2025-01-09 04:15:25,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:15:25,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:15:25,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:15:25,826 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:15:25,826 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:15:25,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2025-01-09 04:15:27,064 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e2be14cc/65841a7dcd244f0994939d4ac1ac77d5/FLAG0d6074f0a [2025-01-09 04:15:27,364 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:15:27,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2025-01-09 04:15:27,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e2be14cc/65841a7dcd244f0994939d4ac1ac77d5/FLAG0d6074f0a [2025-01-09 04:15:27,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e2be14cc/65841a7dcd244f0994939d4ac1ac77d5 [2025-01-09 04:15:27,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:15:27,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:15:27,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:15:27,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:15:27,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:15:27,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:15:27" (1/1) ... [2025-01-09 04:15:27,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32fa3121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:27, skipping insertion in model container [2025-01-09 04:15:27,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:15:27" (1/1) ... [2025-01-09 04:15:27,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:15:27,759 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/systemc/mem_slave_tlm.2.cil.c[646,659] [2025-01-09 04:15:27,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:15:27,851 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:15:27,858 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/systemc/mem_slave_tlm.2.cil.c[646,659] [2025-01-09 04:15:27,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:15:27,922 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:15:27,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:27 WrapperNode [2025-01-09 04:15:27,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:15:27,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:15:27,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:15:27,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:15:27,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:27" (1/1) ... [2025-01-09 04:15:27,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:27" (1/1) ... [2025-01-09 04:15:27,957 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 813 [2025-01-09 04:15:27,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:15:27,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:15:27,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:15:27,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:15:27,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:27" (1/1) ... [2025-01-09 04:15:27,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:27" (1/1) ... [2025-01-09 04:15:27,966 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:27" (1/1) ... [2025-01-09 04:15:27,975 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 04:15:27,975 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:27" (1/1) ... [2025-01-09 04:15:27,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:27" (1/1) ... [2025-01-09 04:15:27,980 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:27" (1/1) ... [2025-01-09 04:15:27,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:27" (1/1) ... [2025-01-09 04:15:27,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:27" (1/1) ... [2025-01-09 04:15:27,989 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:27" (1/1) ... [2025-01-09 04:15:27,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:27" (1/1) ... [2025-01-09 04:15:27,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:15:28,001 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:15:28,001 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:15:28,001 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:15:28,002 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:27" (1/1) ... [2025-01-09 04:15:28,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:15:28,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:28,034 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 04:15:28,037 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 04:15:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:15:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:15:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 04:15:28,058 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 04:15:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:15:28,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:15:28,139 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:15:28,141 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:15:28,785 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2025-01-09 04:15:28,786 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:15:28,801 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:15:28,804 INFO L312 CfgBuilder]: Removed 13 assume(true) statements. [2025-01-09 04:15:28,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:15:28 BoogieIcfgContainer [2025-01-09 04:15:28,804 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:15:28,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:15:28,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:15:28,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:15:28,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:15:27" (1/3) ... [2025-01-09 04:15:28,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28031b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:15:28, skipping insertion in model container [2025-01-09 04:15:28,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:27" (2/3) ... [2025-01-09 04:15:28,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28031b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:15:28, skipping insertion in model container [2025-01-09 04:15:28,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:15:28" (3/3) ... [2025-01-09 04:15:28,812 INFO L128 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.2.cil.c [2025-01-09 04:15:28,822 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:15:28,825 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mem_slave_tlm.2.cil.c that has 2 procedures, 261 locations, 1 initial locations, 13 loop locations, and 1 error locations. [2025-01-09 04:15:28,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:15:28,877 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;@4c42faea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:15:28,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:15:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 261 states, 253 states have (on average 1.841897233201581) internal successors, (466), 259 states have internal predecessors, (466), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 04:15:28,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 04:15:28,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:28,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:28,890 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:28,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:28,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1102776245, now seen corresponding path program 1 times [2025-01-09 04:15:28,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:28,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946377644] [2025-01-09 04:15:28,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:28,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:28,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 04:15:28,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 04:15:28,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:28,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:29,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:29,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946377644] [2025-01-09 04:15:29,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946377644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:29,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:29,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:29,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847634909] [2025-01-09 04:15:29,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:29,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:29,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:29,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:29,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:29,091 INFO L87 Difference]: Start difference. First operand has 261 states, 253 states have (on average 1.841897233201581) internal successors, (466), 259 states have internal predecessors, (466), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:29,365 INFO L93 Difference]: Finished difference Result 682 states and 1242 transitions. [2025-01-09 04:15:29,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:29,367 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-09 04:15:29,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:29,375 INFO L225 Difference]: With dead ends: 682 [2025-01-09 04:15:29,376 INFO L226 Difference]: Without dead ends: 418 [2025-01-09 04:15:29,378 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 04:15:29,381 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 247 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:29,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 747 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:15:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-01-09 04:15:29,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 405. [2025-01-09 04:15:29,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 399 states have (on average 1.6290726817042607) internal successors, (650), 403 states have internal predecessors, (650), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:29,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 655 transitions. [2025-01-09 04:15:29,427 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 655 transitions. Word has length 27 [2025-01-09 04:15:29,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:29,427 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 655 transitions. [2025-01-09 04:15:29,427 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 655 transitions. [2025-01-09 04:15:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 04:15:29,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:29,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:29,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:15:29,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:29,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:29,429 INFO L85 PathProgramCache]: Analyzing trace with hash -672569762, now seen corresponding path program 1 times [2025-01-09 04:15:29,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:29,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121840723] [2025-01-09 04:15:29,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:29,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:29,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 04:15:29,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 04:15:29,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:29,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:29,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:29,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121840723] [2025-01-09 04:15:29,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121840723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:29,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:29,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:29,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499253634] [2025-01-09 04:15:29,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:29,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:29,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:29,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:29,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:29,505 INFO L87 Difference]: Start difference. First operand 405 states and 655 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:29,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:29,620 INFO L93 Difference]: Finished difference Result 1061 states and 1741 transitions. [2025-01-09 04:15:29,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:29,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-01-09 04:15:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:29,623 INFO L225 Difference]: With dead ends: 1061 [2025-01-09 04:15:29,625 INFO L226 Difference]: Without dead ends: 670 [2025-01-09 04:15:29,626 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 04:15:29,628 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 312 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:29,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 984 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:15:29,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-01-09 04:15:29,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 657. [2025-01-09 04:15:29,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 651 states have (on average 1.6651305683563749) internal successors, (1084), 655 states have internal predecessors, (1084), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:29,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1089 transitions. [2025-01-09 04:15:29,655 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1089 transitions. Word has length 35 [2025-01-09 04:15:29,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:29,655 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 1089 transitions. [2025-01-09 04:15:29,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1089 transitions. [2025-01-09 04:15:29,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 04:15:29,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:29,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:29,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:15:29,660 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:29,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:29,660 INFO L85 PathProgramCache]: Analyzing trace with hash 741907095, now seen corresponding path program 1 times [2025-01-09 04:15:29,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:29,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630921534] [2025-01-09 04:15:29,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:29,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:29,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 04:15:29,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 04:15:29,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:29,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:29,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:29,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630921534] [2025-01-09 04:15:29,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630921534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:29,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:29,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:29,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344434848] [2025-01-09 04:15:29,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:29,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:29,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:29,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:29,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:29,728 INFO L87 Difference]: Start difference. First operand 657 states and 1089 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:29,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:29,757 INFO L93 Difference]: Finished difference Result 1645 states and 2736 transitions. [2025-01-09 04:15:29,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:29,757 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-09 04:15:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:29,761 INFO L225 Difference]: With dead ends: 1645 [2025-01-09 04:15:29,761 INFO L226 Difference]: Without dead ends: 1013 [2025-01-09 04:15:29,761 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 04:15:29,762 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 340 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:29,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 785 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:29,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-01-09 04:15:29,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1002. [2025-01-09 04:15:29,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 996 states have (on average 1.6646586345381527) internal successors, (1658), 1000 states have internal predecessors, (1658), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:29,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1663 transitions. [2025-01-09 04:15:29,786 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1663 transitions. Word has length 36 [2025-01-09 04:15:29,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:29,786 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1663 transitions. [2025-01-09 04:15:29,787 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:29,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1663 transitions. [2025-01-09 04:15:29,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 04:15:29,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:29,792 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:29,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:15:29,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:29,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:29,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1801657583, now seen corresponding path program 1 times [2025-01-09 04:15:29,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:29,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788017670] [2025-01-09 04:15:29,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:29,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:29,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 04:15:29,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 04:15:29,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:29,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:29,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:29,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788017670] [2025-01-09 04:15:29,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788017670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:29,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:29,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:15:29,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977099581] [2025-01-09 04:15:29,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:29,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:15:29,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:29,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:15:29,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:15:29,904 INFO L87 Difference]: Start difference. First operand 1002 states and 1663 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:30,217 INFO L93 Difference]: Finished difference Result 2748 states and 4545 transitions. [2025-01-09 04:15:30,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:15:30,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-01-09 04:15:30,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:30,227 INFO L225 Difference]: With dead ends: 2748 [2025-01-09 04:15:30,227 INFO L226 Difference]: Without dead ends: 1771 [2025-01-09 04:15:30,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 04:15:30,231 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 560 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:30,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1494 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:15:30,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2025-01-09 04:15:30,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1550. [2025-01-09 04:15:30,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1544 states have (on average 1.6424870466321244) internal successors, (2536), 1548 states have internal predecessors, (2536), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2541 transitions. [2025-01-09 04:15:30,268 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2541 transitions. Word has length 42 [2025-01-09 04:15:30,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:30,268 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2541 transitions. [2025-01-09 04:15:30,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:30,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2541 transitions. [2025-01-09 04:15:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 04:15:30,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:30,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:30,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:15:30,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:30,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:30,271 INFO L85 PathProgramCache]: Analyzing trace with hash 985208297, now seen corresponding path program 1 times [2025-01-09 04:15:30,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:30,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955283929] [2025-01-09 04:15:30,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:30,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:30,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 04:15:30,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 04:15:30,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:30,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:30,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:30,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955283929] [2025-01-09 04:15:30,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955283929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:30,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:30,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:15:30,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68659188] [2025-01-09 04:15:30,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:30,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:15:30,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:30,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:15:30,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:15:30,331 INFO L87 Difference]: Start difference. First operand 1550 states and 2541 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:30,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:30,696 INFO L93 Difference]: Finished difference Result 4573 states and 7416 transitions. [2025-01-09 04:15:30,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:15:30,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-01-09 04:15:30,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:30,707 INFO L225 Difference]: With dead ends: 4573 [2025-01-09 04:15:30,707 INFO L226 Difference]: Without dead ends: 3042 [2025-01-09 04:15:30,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 04:15:30,710 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 708 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:30,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 999 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:15:30,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2025-01-09 04:15:30,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2710. [2025-01-09 04:15:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2704 states have (on average 1.6164940828402368) internal successors, (4371), 2708 states have internal predecessors, (4371), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 4376 transitions. [2025-01-09 04:15:30,777 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 4376 transitions. Word has length 47 [2025-01-09 04:15:30,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:30,778 INFO L471 AbstractCegarLoop]: Abstraction has 2710 states and 4376 transitions. [2025-01-09 04:15:30,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 4376 transitions. [2025-01-09 04:15:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 04:15:30,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:30,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:30,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:15:30,780 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:30,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:30,782 INFO L85 PathProgramCache]: Analyzing trace with hash -917629367, now seen corresponding path program 1 times [2025-01-09 04:15:30,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:30,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912328235] [2025-01-09 04:15:30,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:30,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:30,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 04:15:30,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 04:15:30,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:30,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:30,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:30,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912328235] [2025-01-09 04:15:30,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912328235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:30,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:30,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:30,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913167993] [2025-01-09 04:15:30,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:30,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:30,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:30,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:30,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:30,824 INFO L87 Difference]: Start difference. First operand 2710 states and 4376 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:30,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:30,919 INFO L93 Difference]: Finished difference Result 6321 states and 10189 transitions. [2025-01-09 04:15:30,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:30,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-01-09 04:15:30,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:30,931 INFO L225 Difference]: With dead ends: 6321 [2025-01-09 04:15:30,932 INFO L226 Difference]: Without dead ends: 3634 [2025-01-09 04:15:30,936 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 04:15:30,938 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 358 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:30,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 680 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:30,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3634 states. [2025-01-09 04:15:31,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3634 to 3478. [2025-01-09 04:15:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3478 states, 3472 states have (on average 1.5982142857142858) internal successors, (5549), 3476 states have internal predecessors, (5549), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 5554 transitions. [2025-01-09 04:15:31,069 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 5554 transitions. Word has length 47 [2025-01-09 04:15:31,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:31,069 INFO L471 AbstractCegarLoop]: Abstraction has 3478 states and 5554 transitions. [2025-01-09 04:15:31,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 5554 transitions. [2025-01-09 04:15:31,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 04:15:31,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:31,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:31,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:15:31,072 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:31,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:31,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1203822141, now seen corresponding path program 1 times [2025-01-09 04:15:31,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:31,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952859192] [2025-01-09 04:15:31,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:31,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:31,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 04:15:31,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 04:15:31,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:31,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:31,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:31,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:31,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952859192] [2025-01-09 04:15:31,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952859192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:31,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:31,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:31,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076128209] [2025-01-09 04:15:31,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:31,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:31,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:31,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:31,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:31,126 INFO L87 Difference]: Start difference. First operand 3478 states and 5554 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:31,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:31,520 INFO L93 Difference]: Finished difference Result 8360 states and 13466 transitions. [2025-01-09 04:15:31,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:31,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-01-09 04:15:31,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:31,540 INFO L225 Difference]: With dead ends: 8360 [2025-01-09 04:15:31,541 INFO L226 Difference]: Without dead ends: 4905 [2025-01-09 04:15:31,547 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 04:15:31,548 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 235 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:31,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 837 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:15:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2025-01-09 04:15:31,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4216. [2025-01-09 04:15:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4216 states, 4210 states have (on average 1.5339667458432305) internal successors, (6458), 4214 states have internal predecessors, (6458), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4216 states to 4216 states and 6463 transitions. [2025-01-09 04:15:31,713 INFO L78 Accepts]: Start accepts. Automaton has 4216 states and 6463 transitions. Word has length 52 [2025-01-09 04:15:31,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:31,713 INFO L471 AbstractCegarLoop]: Abstraction has 4216 states and 6463 transitions. [2025-01-09 04:15:31,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:31,714 INFO L276 IsEmpty]: Start isEmpty. Operand 4216 states and 6463 transitions. [2025-01-09 04:15:31,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 04:15:31,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:31,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:31,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:15:31,716 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:31,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:31,717 INFO L85 PathProgramCache]: Analyzing trace with hash -356436561, now seen corresponding path program 1 times [2025-01-09 04:15:31,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:31,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935313419] [2025-01-09 04:15:31,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:31,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:31,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 04:15:31,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 04:15:31,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:31,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:31,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:31,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:31,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935313419] [2025-01-09 04:15:31,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935313419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:31,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:31,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:31,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114872688] [2025-01-09 04:15:31,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:31,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:31,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:31,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:31,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:31,785 INFO L87 Difference]: Start difference. First operand 4216 states and 6463 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:31,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:31,931 INFO L93 Difference]: Finished difference Result 8283 states and 12711 transitions. [2025-01-09 04:15:31,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:31,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-01-09 04:15:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:31,944 INFO L225 Difference]: With dead ends: 8283 [2025-01-09 04:15:31,944 INFO L226 Difference]: Without dead ends: 4090 [2025-01-09 04:15:31,949 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 04:15:31,950 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 336 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:31,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 427 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:31,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2025-01-09 04:15:32,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 4090. [2025-01-09 04:15:32,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4090 states, 4084 states have (on average 1.5095494613124387) internal successors, (6165), 4088 states have internal predecessors, (6165), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:32,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4090 states to 4090 states and 6170 transitions. [2025-01-09 04:15:32,052 INFO L78 Accepts]: Start accepts. Automaton has 4090 states and 6170 transitions. Word has length 54 [2025-01-09 04:15:32,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:32,052 INFO L471 AbstractCegarLoop]: Abstraction has 4090 states and 6170 transitions. [2025-01-09 04:15:32,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:32,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4090 states and 6170 transitions. [2025-01-09 04:15:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 04:15:32,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:32,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:32,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:15:32,073 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:32,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:32,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1355329210, now seen corresponding path program 1 times [2025-01-09 04:15:32,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:32,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399047629] [2025-01-09 04:15:32,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:32,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:32,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 04:15:32,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 04:15:32,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:32,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:32,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:32,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399047629] [2025-01-09 04:15:32,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399047629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:32,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:32,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:32,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819360208] [2025-01-09 04:15:32,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:32,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:32,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:32,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:32,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:32,141 INFO L87 Difference]: Start difference. First operand 4090 states and 6170 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:32,252 INFO L93 Difference]: Finished difference Result 7810 states and 11899 transitions. [2025-01-09 04:15:32,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:32,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-01-09 04:15:32,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:32,268 INFO L225 Difference]: With dead ends: 7810 [2025-01-09 04:15:32,268 INFO L226 Difference]: Without dead ends: 3743 [2025-01-09 04:15:32,276 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 04:15:32,279 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 145 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:32,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 862 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3743 states. [2025-01-09 04:15:32,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3743 to 3154. [2025-01-09 04:15:32,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3154 states, 3148 states have (on average 1.531448538754765) internal successors, (4821), 3152 states have internal predecessors, (4821), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3154 states to 3154 states and 4826 transitions. [2025-01-09 04:15:32,402 INFO L78 Accepts]: Start accepts. Automaton has 3154 states and 4826 transitions. Word has length 54 [2025-01-09 04:15:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:32,402 INFO L471 AbstractCegarLoop]: Abstraction has 3154 states and 4826 transitions. [2025-01-09 04:15:32,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3154 states and 4826 transitions. [2025-01-09 04:15:32,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:15:32,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:32,404 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:32,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:15:32,404 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:32,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:32,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1113953534, now seen corresponding path program 1 times [2025-01-09 04:15:32,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:32,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159663973] [2025-01-09 04:15:32,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:32,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:32,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:15:32,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:15:32,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:32,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:32,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:32,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159663973] [2025-01-09 04:15:32,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159663973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:32,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:32,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:15:32,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393566234] [2025-01-09 04:15:32,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:32,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:15:32,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:32,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:15:32,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:32,533 INFO L87 Difference]: Start difference. First operand 3154 states and 4826 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:33,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:33,026 INFO L93 Difference]: Finished difference Result 8583 states and 13084 transitions. [2025-01-09 04:15:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:15:33,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-01-09 04:15:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:33,052 INFO L225 Difference]: With dead ends: 8583 [2025-01-09 04:15:33,053 INFO L226 Difference]: Without dead ends: 5630 [2025-01-09 04:15:33,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:15:33,060 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 906 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 2311 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:33,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 2311 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:15:33,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2025-01-09 04:15:33,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 3924. [2025-01-09 04:15:33,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3924 states, 3918 states have (on average 1.5270546197039305) internal successors, (5983), 3922 states have internal predecessors, (5983), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:33,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 5988 transitions. [2025-01-09 04:15:33,250 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 5988 transitions. Word has length 57 [2025-01-09 04:15:33,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:33,250 INFO L471 AbstractCegarLoop]: Abstraction has 3924 states and 5988 transitions. [2025-01-09 04:15:33,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:33,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 5988 transitions. [2025-01-09 04:15:33,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 04:15:33,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:33,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:33,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:15:33,252 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:33,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:33,252 INFO L85 PathProgramCache]: Analyzing trace with hash 673567293, now seen corresponding path program 1 times [2025-01-09 04:15:33,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:33,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470231020] [2025-01-09 04:15:33,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:33,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:33,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 04:15:33,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 04:15:33,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:33,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:33,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:33,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470231020] [2025-01-09 04:15:33,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470231020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:33,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:33,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:15:33,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217335522] [2025-01-09 04:15:33,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:33,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:15:33,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:33,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:15:33,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:15:33,333 INFO L87 Difference]: Start difference. First operand 3924 states and 5988 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:33,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:33,557 INFO L93 Difference]: Finished difference Result 9427 states and 14284 transitions. [2025-01-09 04:15:33,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:15:33,557 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-01-09 04:15:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:33,571 INFO L225 Difference]: With dead ends: 9427 [2025-01-09 04:15:33,571 INFO L226 Difference]: Without dead ends: 5704 [2025-01-09 04:15:33,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:15:33,579 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 798 mSDsluCounter, 2314 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 2837 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:33,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 2837 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:15:33,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5704 states. [2025-01-09 04:15:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5704 to 4208. [2025-01-09 04:15:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4208 states, 4202 states have (on average 1.5157068062827226) internal successors, (6369), 4206 states have internal predecessors, (6369), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:33,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4208 states to 4208 states and 6374 transitions. [2025-01-09 04:15:33,740 INFO L78 Accepts]: Start accepts. Automaton has 4208 states and 6374 transitions. Word has length 58 [2025-01-09 04:15:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:33,740 INFO L471 AbstractCegarLoop]: Abstraction has 4208 states and 6374 transitions. [2025-01-09 04:15:33,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:33,741 INFO L276 IsEmpty]: Start isEmpty. Operand 4208 states and 6374 transitions. [2025-01-09 04:15:33,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:15:33,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:33,742 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:33,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:15:33,743 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:33,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:33,743 INFO L85 PathProgramCache]: Analyzing trace with hash 477974043, now seen corresponding path program 1 times [2025-01-09 04:15:33,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:33,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424046523] [2025-01-09 04:15:33,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:33,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:33,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:15:33,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:15:33,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:33,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:33,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:33,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424046523] [2025-01-09 04:15:33,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424046523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:33,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:33,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:33,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462764986] [2025-01-09 04:15:33,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:33,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:33,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:33,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:33,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:33,782 INFO L87 Difference]: Start difference. First operand 4208 states and 6374 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:33,902 INFO L93 Difference]: Finished difference Result 8857 states and 13382 transitions. [2025-01-09 04:15:33,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:33,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 04:15:33,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:33,913 INFO L225 Difference]: With dead ends: 8857 [2025-01-09 04:15:33,913 INFO L226 Difference]: Without dead ends: 4670 [2025-01-09 04:15:33,920 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 04:15:33,920 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 125 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:33,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 785 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:33,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2025-01-09 04:15:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4612. [2025-01-09 04:15:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4612 states, 4606 states have (on average 1.5078158923143725) internal successors, (6945), 4610 states have internal predecessors, (6945), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 6950 transitions. [2025-01-09 04:15:34,069 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 6950 transitions. Word has length 70 [2025-01-09 04:15:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:34,069 INFO L471 AbstractCegarLoop]: Abstraction has 4612 states and 6950 transitions. [2025-01-09 04:15:34,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 6950 transitions. [2025-01-09 04:15:34,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 04:15:34,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:34,071 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:34,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:15:34,072 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:34,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:34,072 INFO L85 PathProgramCache]: Analyzing trace with hash -803981797, now seen corresponding path program 1 times [2025-01-09 04:15:34,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:34,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201008294] [2025-01-09 04:15:34,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:34,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:34,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 04:15:34,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 04:15:34,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:34,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:34,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:34,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201008294] [2025-01-09 04:15:34,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201008294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:34,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:34,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:15:34,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654512090] [2025-01-09 04:15:34,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:34,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:15:34,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:34,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:15:34,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:15:34,127 INFO L87 Difference]: Start difference. First operand 4612 states and 6950 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:34,530 INFO L93 Difference]: Finished difference Result 12253 states and 18339 transitions. [2025-01-09 04:15:34,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:15:34,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-01-09 04:15:34,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:34,549 INFO L225 Difference]: With dead ends: 12253 [2025-01-09 04:15:34,550 INFO L226 Difference]: Without dead ends: 7552 [2025-01-09 04:15:34,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 04:15:34,560 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 615 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:34,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1348 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:15:34,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7552 states. [2025-01-09 04:15:34,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7552 to 6741. [2025-01-09 04:15:34,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6741 states, 6735 states have (on average 1.4846325167037862) internal successors, (9999), 6739 states have internal predecessors, (9999), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6741 states to 6741 states and 10004 transitions. [2025-01-09 04:15:34,824 INFO L78 Accepts]: Start accepts. Automaton has 6741 states and 10004 transitions. Word has length 80 [2025-01-09 04:15:34,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:34,824 INFO L471 AbstractCegarLoop]: Abstraction has 6741 states and 10004 transitions. [2025-01-09 04:15:34,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:34,825 INFO L276 IsEmpty]: Start isEmpty. Operand 6741 states and 10004 transitions. [2025-01-09 04:15:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:15:34,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:34,827 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:34,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:15:34,827 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:34,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:34,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1656892535, now seen corresponding path program 1 times [2025-01-09 04:15:34,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:34,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443671429] [2025-01-09 04:15:34,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:34,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:34,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:15:34,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:15:34,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:34,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:34,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:34,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443671429] [2025-01-09 04:15:34,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443671429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:34,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:34,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:34,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778995632] [2025-01-09 04:15:34,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:34,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:34,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:34,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:34,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:34,887 INFO L87 Difference]: Start difference. First operand 6741 states and 10004 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:35,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:35,038 INFO L93 Difference]: Finished difference Result 9716 states and 14469 transitions. [2025-01-09 04:15:35,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:35,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-01-09 04:15:35,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:35,049 INFO L225 Difference]: With dead ends: 9716 [2025-01-09 04:15:35,049 INFO L226 Difference]: Without dead ends: 2979 [2025-01-09 04:15:35,058 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 04:15:35,058 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 328 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:35,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 489 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2025-01-09 04:15:35,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2934. [2025-01-09 04:15:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2934 states, 2928 states have (on average 1.389344262295082) internal successors, (4068), 2932 states have internal predecessors, (4068), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 4073 transitions. [2025-01-09 04:15:35,159 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 4073 transitions. Word has length 87 [2025-01-09 04:15:35,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:35,159 INFO L471 AbstractCegarLoop]: Abstraction has 2934 states and 4073 transitions. [2025-01-09 04:15:35,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:35,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 4073 transitions. [2025-01-09 04:15:35,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 04:15:35,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:35,160 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:35,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:15:35,160 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:35,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:35,160 INFO L85 PathProgramCache]: Analyzing trace with hash 472936800, now seen corresponding path program 1 times [2025-01-09 04:15:35,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:35,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813154608] [2025-01-09 04:15:35,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:35,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:35,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 04:15:35,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 04:15:35,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:35,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:35,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:35,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:35,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813154608] [2025-01-09 04:15:35,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813154608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:35,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:35,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:15:35,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778349314] [2025-01-09 04:15:35,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:35,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:15:35,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:35,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:15:35,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:15:35,234 INFO L87 Difference]: Start difference. First operand 2934 states and 4073 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:35,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:35,397 INFO L93 Difference]: Finished difference Result 6679 states and 9272 transitions. [2025-01-09 04:15:35,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:15:35,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 04:15:35,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:35,405 INFO L225 Difference]: With dead ends: 6679 [2025-01-09 04:15:35,405 INFO L226 Difference]: Without dead ends: 3901 [2025-01-09 04:15:35,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:15:35,409 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 521 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 2274 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:35,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 2274 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:35,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3901 states. [2025-01-09 04:15:35,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3901 to 2936. [2025-01-09 04:15:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2930 states have (on average 1.3870307167235494) internal successors, (4064), 2934 states have internal predecessors, (4064), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 4069 transitions. [2025-01-09 04:15:35,479 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 4069 transitions. Word has length 90 [2025-01-09 04:15:35,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:35,480 INFO L471 AbstractCegarLoop]: Abstraction has 2936 states and 4069 transitions. [2025-01-09 04:15:35,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:35,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 4069 transitions. [2025-01-09 04:15:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 04:15:35,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:35,481 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:35,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:15:35,481 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:35,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:35,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1424817605, now seen corresponding path program 1 times [2025-01-09 04:15:35,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:35,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657472984] [2025-01-09 04:15:35,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:35,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:35,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 04:15:35,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 04:15:35,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:35,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:35,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:35,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:35,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657472984] [2025-01-09 04:15:35,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657472984] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:35,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901913720] [2025-01-09 04:15:35,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:35,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:35,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:35,549 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 04:15:35,551 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 04:15:35,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 04:15:35,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 04:15:35,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:35,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:35,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 04:15:35,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:15:35,754 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:15:35,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901913720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:35,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:15:35,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 04:15:35,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067033402] [2025-01-09 04:15:35,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:35,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:35,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:35,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:35,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:35,758 INFO L87 Difference]: Start difference. First operand 2936 states and 4069 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:35,886 INFO L93 Difference]: Finished difference Result 3539 states and 4882 transitions. [2025-01-09 04:15:35,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:35,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-09 04:15:35,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:35,896 INFO L225 Difference]: With dead ends: 3539 [2025-01-09 04:15:35,897 INFO L226 Difference]: Without dead ends: 3535 [2025-01-09 04:15:35,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:35,899 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 223 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:35,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 765 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:35,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3535 states. [2025-01-09 04:15:36,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3535 to 3485. [2025-01-09 04:15:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3485 states, 3479 states have (on average 1.3794193733831561) internal successors, (4799), 3483 states have internal predecessors, (4799), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:36,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 4804 transitions. [2025-01-09 04:15:36,014 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 4804 transitions. Word has length 92 [2025-01-09 04:15:36,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:36,014 INFO L471 AbstractCegarLoop]: Abstraction has 3485 states and 4804 transitions. [2025-01-09 04:15:36,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:36,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 4804 transitions. [2025-01-09 04:15:36,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 04:15:36,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:36,016 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:36,026 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 04:15:36,217 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,SelfDestructingSolverStorable15 [2025-01-09 04:15:36,217 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:36,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:36,218 INFO L85 PathProgramCache]: Analyzing trace with hash -366160225, now seen corresponding path program 1 times [2025-01-09 04:15:36,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:36,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255125889] [2025-01-09 04:15:36,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:36,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:36,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 04:15:36,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 04:15:36,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:36,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:36,286 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:36,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:36,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255125889] [2025-01-09 04:15:36,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255125889] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:36,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2862879] [2025-01-09 04:15:36,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:36,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:36,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:36,292 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 04:15:36,298 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 04:15:36,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 04:15:36,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 04:15:36,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:36,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:36,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 04:15:36,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:15:36,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:15:36,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2862879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:36,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:15:36,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 04:15:36,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62891429] [2025-01-09 04:15:36,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:36,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:36,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:36,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:36,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:36,449 INFO L87 Difference]: Start difference. First operand 3485 states and 4804 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:36,535 INFO L93 Difference]: Finished difference Result 6224 states and 8618 transitions. [2025-01-09 04:15:36,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:36,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2025-01-09 04:15:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:36,541 INFO L225 Difference]: With dead ends: 6224 [2025-01-09 04:15:36,541 INFO L226 Difference]: Without dead ends: 2746 [2025-01-09 04:15:36,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:36,544 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 252 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:36,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 406 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:36,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2025-01-09 04:15:36,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2553. [2025-01-09 04:15:36,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 2547 states have (on average 1.3513937966234786) internal successors, (3442), 2551 states have internal predecessors, (3442), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3447 transitions. [2025-01-09 04:15:36,595 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3447 transitions. Word has length 140 [2025-01-09 04:15:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:36,596 INFO L471 AbstractCegarLoop]: Abstraction has 2553 states and 3447 transitions. [2025-01-09 04:15:36,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3447 transitions. [2025-01-09 04:15:36,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 04:15:36,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:36,598 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:36,604 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 04:15:36,798 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 04:15:36,798 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:36,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:36,799 INFO L85 PathProgramCache]: Analyzing trace with hash -823447369, now seen corresponding path program 1 times [2025-01-09 04:15:36,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:36,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766669118] [2025-01-09 04:15:36,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:36,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:36,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 04:15:36,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 04:15:36,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:36,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:36,926 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:15:36,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:36,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766669118] [2025-01-09 04:15:36,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766669118] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:36,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785217951] [2025-01-09 04:15:36,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:36,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:36,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:36,928 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 04:15:36,930 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 04:15:36,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 04:15:37,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 04:15:37,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:37,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:37,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 04:15:37,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:15:37,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:15:37,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785217951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:37,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:15:37,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 04:15:37,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329555058] [2025-01-09 04:15:37,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:37,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:37,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:37,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:37,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:37,082 INFO L87 Difference]: Start difference. First operand 2553 states and 3447 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:37,167 INFO L93 Difference]: Finished difference Result 4953 states and 6726 transitions. [2025-01-09 04:15:37,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:37,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-01-09 04:15:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:37,175 INFO L225 Difference]: With dead ends: 4953 [2025-01-09 04:15:37,175 INFO L226 Difference]: Without dead ends: 2553 [2025-01-09 04:15:37,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:37,179 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 264 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:37,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 378 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:37,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2025-01-09 04:15:37,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 2553. [2025-01-09 04:15:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 2547 states have (on average 1.3137023949744797) internal successors, (3346), 2551 states have internal predecessors, (3346), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:37,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3351 transitions. [2025-01-09 04:15:37,241 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3351 transitions. Word has length 143 [2025-01-09 04:15:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:37,241 INFO L471 AbstractCegarLoop]: Abstraction has 2553 states and 3351 transitions. [2025-01-09 04:15:37,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3351 transitions. [2025-01-09 04:15:37,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 04:15:37,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:37,243 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:37,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 04:15:37,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:37,443 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:37,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:37,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1191671384, now seen corresponding path program 1 times [2025-01-09 04:15:37,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:37,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292760007] [2025-01-09 04:15:37,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:37,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:37,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 04:15:37,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 04:15:37,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:37,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:15:37,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:37,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292760007] [2025-01-09 04:15:37,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292760007] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:37,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13495858] [2025-01-09 04:15:37,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:37,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:37,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:37,575 INFO L229 MonitoredProcess]: Starting monitored process 5 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 04:15:37,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 04:15:37,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 04:15:37,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 04:15:37,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:37,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:37,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 04:15:37,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:15:37,736 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:15:37,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13495858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:37,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:15:37,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 04:15:37,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733824856] [2025-01-09 04:15:37,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:37,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:37,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:37,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:37,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:37,738 INFO L87 Difference]: Start difference. First operand 2553 states and 3351 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:38,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:38,071 INFO L93 Difference]: Finished difference Result 5755 states and 7718 transitions. [2025-01-09 04:15:38,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:38,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2025-01-09 04:15:38,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:38,083 INFO L225 Difference]: With dead ends: 5755 [2025-01-09 04:15:38,083 INFO L226 Difference]: Without dead ends: 3355 [2025-01-09 04:15:38,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:38,087 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 190 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:38,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 618 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:15:38,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2025-01-09 04:15:38,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 3275. [2025-01-09 04:15:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 3269 states have (on average 1.2789843988987457) internal successors, (4181), 3273 states have internal predecessors, (4181), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:38,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 4186 transitions. [2025-01-09 04:15:38,181 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 4186 transitions. Word has length 144 [2025-01-09 04:15:38,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:38,182 INFO L471 AbstractCegarLoop]: Abstraction has 3275 states and 4186 transitions. [2025-01-09 04:15:38,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:38,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 4186 transitions. [2025-01-09 04:15:38,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 04:15:38,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:38,184 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:38,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 04:15:38,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:38,385 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:38,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:38,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1816045461, now seen corresponding path program 1 times [2025-01-09 04:15:38,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:38,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007040357] [2025-01-09 04:15:38,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:38,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:38,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 04:15:38,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 04:15:38,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:38,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:15:38,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:38,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007040357] [2025-01-09 04:15:38,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007040357] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:38,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637850970] [2025-01-09 04:15:38,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:38,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:38,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:38,614 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 04:15:38,616 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 04:15:38,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 04:15:38,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 04:15:38,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:38,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:38,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 04:15:38,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:15:38,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:15:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:15:39,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637850970] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:15:39,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:15:39,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2025-01-09 04:15:39,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106567839] [2025-01-09 04:15:39,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:15:39,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:15:39,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:39,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:15:39,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:15:39,124 INFO L87 Difference]: Start difference. First operand 3275 states and 4186 transitions. Second operand has 10 states, 10 states have (on average 14.7) internal successors, (147), 10 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:39,580 INFO L93 Difference]: Finished difference Result 8826 states and 11301 transitions. [2025-01-09 04:15:39,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:15:39,580 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.7) internal successors, (147), 10 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2025-01-09 04:15:39,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:39,590 INFO L225 Difference]: With dead ends: 8826 [2025-01-09 04:15:39,590 INFO L226 Difference]: Without dead ends: 5704 [2025-01-09 04:15:39,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:15:39,592 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 871 mSDsluCounter, 3554 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 4065 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:39,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 4065 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:15:39,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5704 states. [2025-01-09 04:15:39,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5704 to 4671. [2025-01-09 04:15:39,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4671 states, 4665 states have (on average 1.282100750267953) internal successors, (5981), 4669 states have internal predecessors, (5981), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:39,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4671 states to 4671 states and 5986 transitions. [2025-01-09 04:15:39,693 INFO L78 Accepts]: Start accepts. Automaton has 4671 states and 5986 transitions. Word has length 147 [2025-01-09 04:15:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:39,693 INFO L471 AbstractCegarLoop]: Abstraction has 4671 states and 5986 transitions. [2025-01-09 04:15:39,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.7) internal successors, (147), 10 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 4671 states and 5986 transitions. [2025-01-09 04:15:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-01-09 04:15:39,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:39,695 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:39,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 04:15:39,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:39,896 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:39,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:39,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1495637362, now seen corresponding path program 1 times [2025-01-09 04:15:39,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:39,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901650228] [2025-01-09 04:15:39,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:39,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:39,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-09 04:15:39,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-09 04:15:39,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:39,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 88 proven. 89 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:15:40,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:40,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901650228] [2025-01-09 04:15:40,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901650228] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:40,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395389621] [2025-01-09 04:15:40,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:40,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:40,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:40,108 INFO L229 MonitoredProcess]: Starting monitored process 7 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 04:15:40,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 04:15:40,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-09 04:15:40,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-09 04:15:40,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:40,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:40,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 04:15:40,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:40,507 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:15:40,508 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:15:40,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395389621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:40,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:15:40,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-01-09 04:15:40,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449206574] [2025-01-09 04:15:40,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:40,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:15:40,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:40,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:15:40,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:15:40,509 INFO L87 Difference]: Start difference. First operand 4671 states and 5986 transitions. Second operand has 7 states, 7 states have (on average 33.714285714285715) internal successors, (236), 7 states have internal predecessors, (236), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:40,837 INFO L93 Difference]: Finished difference Result 9794 states and 12555 transitions. [2025-01-09 04:15:40,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:15:40,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.714285714285715) internal successors, (236), 7 states have internal predecessors, (236), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2025-01-09 04:15:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:40,847 INFO L225 Difference]: With dead ends: 9794 [2025-01-09 04:15:40,847 INFO L226 Difference]: Without dead ends: 5274 [2025-01-09 04:15:40,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:15:40,851 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 966 mSDsluCounter, 1903 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 2599 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:40,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 2599 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:15:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5274 states. [2025-01-09 04:15:40,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5274 to 4558. [2025-01-09 04:15:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4558 states, 4552 states have (on average 1.2792179261862917) internal successors, (5823), 4556 states have internal predecessors, (5823), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4558 states to 4558 states and 5828 transitions. [2025-01-09 04:15:40,942 INFO L78 Accepts]: Start accepts. Automaton has 4558 states and 5828 transitions. Word has length 238 [2025-01-09 04:15:40,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:40,942 INFO L471 AbstractCegarLoop]: Abstraction has 4558 states and 5828 transitions. [2025-01-09 04:15:40,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.714285714285715) internal successors, (236), 7 states have internal predecessors, (236), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 4558 states and 5828 transitions. [2025-01-09 04:15:40,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-01-09 04:15:40,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:40,945 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:40,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 04:15:41,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-09 04:15:41,149 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:41,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:41,150 INFO L85 PathProgramCache]: Analyzing trace with hash -445305347, now seen corresponding path program 1 times [2025-01-09 04:15:41,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:41,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336810845] [2025-01-09 04:15:41,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:41,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:41,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-09 04:15:41,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-09 04:15:41,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:41,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-01-09 04:15:41,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:41,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336810845] [2025-01-09 04:15:41,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336810845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:41,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:41,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:41,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370561276] [2025-01-09 04:15:41,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:41,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:41,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:41,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:41,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:41,251 INFO L87 Difference]: Start difference. First operand 4558 states and 5828 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:41,387 INFO L93 Difference]: Finished difference Result 5349 states and 6725 transitions. [2025-01-09 04:15:41,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:41,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2025-01-09 04:15:41,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:41,393 INFO L225 Difference]: With dead ends: 5349 [2025-01-09 04:15:41,393 INFO L226 Difference]: Without dead ends: 839 [2025-01-09 04:15:41,396 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 04:15:41,398 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 123 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:41,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 356 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:15:41,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2025-01-09 04:15:41,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2025-01-09 04:15:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 833 states have (on average 1.0912364945978392) internal successors, (909), 835 states have internal predecessors, (909), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 912 transitions. [2025-01-09 04:15:41,421 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 912 transitions. Word has length 238 [2025-01-09 04:15:41,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:41,422 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 912 transitions. [2025-01-09 04:15:41,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 912 transitions. [2025-01-09 04:15:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-01-09 04:15:41,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:41,424 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:41,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:15:41,424 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:41,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:41,425 INFO L85 PathProgramCache]: Analyzing trace with hash 155796327, now seen corresponding path program 1 times [2025-01-09 04:15:41,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:41,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971080681] [2025-01-09 04:15:41,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:41,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:41,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-01-09 04:15:41,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-01-09 04:15:41,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:41,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-01-09 04:15:41,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:41,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971080681] [2025-01-09 04:15:41,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971080681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:41,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:41,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:15:41,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684199663] [2025-01-09 04:15:41,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:41,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:15:41,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:41,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:15:41,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:15:41,539 INFO L87 Difference]: Start difference. First operand 837 states and 912 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:41,635 INFO L93 Difference]: Finished difference Result 1122 states and 1221 transitions. [2025-01-09 04:15:41,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:15:41,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2025-01-09 04:15:41,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:41,639 INFO L225 Difference]: With dead ends: 1122 [2025-01-09 04:15:41,639 INFO L226 Difference]: Without dead ends: 845 [2025-01-09 04:15:41,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:15:41,640 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 204 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:41,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1361 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:41,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-01-09 04:15:41,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 835. [2025-01-09 04:15:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 831 states have (on average 1.0866425992779782) internal successors, (903), 833 states have internal predecessors, (903), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 906 transitions. [2025-01-09 04:15:41,689 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 906 transitions. Word has length 239 [2025-01-09 04:15:41,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:41,689 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 906 transitions. [2025-01-09 04:15:41,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 906 transitions. [2025-01-09 04:15:41,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-01-09 04:15:41,692 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:41,693 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:41,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:15:41,693 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:41,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:41,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1035464948, now seen corresponding path program 1 times [2025-01-09 04:15:41,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:41,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307244056] [2025-01-09 04:15:41,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:41,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:41,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-01-09 04:15:41,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-01-09 04:15:41,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:41,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-01-09 04:15:41,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:41,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307244056] [2025-01-09 04:15:41,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307244056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:41,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:41,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:15:41,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373461609] [2025-01-09 04:15:41,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:41,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:15:41,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:41,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:15:41,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:15:41,794 INFO L87 Difference]: Start difference. First operand 835 states and 906 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:41,868 INFO L93 Difference]: Finished difference Result 1101 states and 1191 transitions. [2025-01-09 04:15:41,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:15:41,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 240 [2025-01-09 04:15:41,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:41,873 INFO L225 Difference]: With dead ends: 1101 [2025-01-09 04:15:41,873 INFO L226 Difference]: Without dead ends: 822 [2025-01-09 04:15:41,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:15:41,874 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 166 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:41,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 793 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:41,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-01-09 04:15:41,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 818. [2025-01-09 04:15:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 815 states have (on average 1.0687116564417178) internal successors, (871), 816 states have internal predecessors, (871), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 873 transitions. [2025-01-09 04:15:41,911 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 873 transitions. Word has length 240 [2025-01-09 04:15:41,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:41,911 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 873 transitions. [2025-01-09 04:15:41,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:41,912 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 873 transitions. [2025-01-09 04:15:41,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 04:15:41,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:41,915 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:41,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:15:41,915 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:41,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:41,915 INFO L85 PathProgramCache]: Analyzing trace with hash 273602595, now seen corresponding path program 1 times [2025-01-09 04:15:41,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:41,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483117671] [2025-01-09 04:15:41,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:41,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:41,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 04:15:41,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 04:15:41,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:41,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:42,838 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 33 proven. 117 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-09 04:15:42,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:42,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483117671] [2025-01-09 04:15:42,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483117671] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:42,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227306141] [2025-01-09 04:15:42,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:42,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:42,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:42,845 INFO L229 MonitoredProcess]: Starting monitored process 8 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 04:15:42,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 04:15:42,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 04:15:43,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 04:15:43,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:43,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:43,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 04:15:43,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 34 proven. 102 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 04:15:43,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:15:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 12 proven. 124 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 04:15:43,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227306141] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:15:43,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:15:43,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 30 [2025-01-09 04:15:43,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878463873] [2025-01-09 04:15:43,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:15:43,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 04:15:43,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:43,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 04:15:43,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=792, Unknown=0, NotChecked=0, Total=870 [2025-01-09 04:15:43,850 INFO L87 Difference]: Start difference. First operand 818 states and 873 transitions. Second operand has 30 states, 30 states have (on average 12.566666666666666) internal successors, (377), 30 states have internal predecessors, (377), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:44,395 INFO L93 Difference]: Finished difference Result 829 states and 883 transitions. [2025-01-09 04:15:44,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 04:15:44,396 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 12.566666666666666) internal successors, (377), 30 states have internal predecessors, (377), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 295 [2025-01-09 04:15:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:44,400 INFO L225 Difference]: With dead ends: 829 [2025-01-09 04:15:44,401 INFO L226 Difference]: Without dead ends: 826 [2025-01-09 04:15:44,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 581 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=1701, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 04:15:44,402 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 547 mSDsluCounter, 7282 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 7639 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:44,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 7639 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:15:44,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2025-01-09 04:15:44,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 818. [2025-01-09 04:15:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 815 states have (on average 1.0674846625766872) internal successors, (870), 816 states have internal predecessors, (870), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:44,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 872 transitions. [2025-01-09 04:15:44,433 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 872 transitions. Word has length 295 [2025-01-09 04:15:44,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:44,434 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 872 transitions. [2025-01-09 04:15:44,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 12.566666666666666) internal successors, (377), 30 states have internal predecessors, (377), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 872 transitions. [2025-01-09 04:15:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-01-09 04:15:44,438 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:44,438 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:44,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 04:15:44,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:44,640 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:44,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:44,641 INFO L85 PathProgramCache]: Analyzing trace with hash -450485865, now seen corresponding path program 1 times [2025-01-09 04:15:44,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:44,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703276746] [2025-01-09 04:15:44,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:44,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:44,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-01-09 04:15:44,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-01-09 04:15:44,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:44,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 122 proven. 41 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-01-09 04:15:44,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:44,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703276746] [2025-01-09 04:15:44,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703276746] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:44,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494674171] [2025-01-09 04:15:44,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:44,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:44,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:44,959 INFO L229 MonitoredProcess]: Starting monitored process 9 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 04:15:44,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 04:15:45,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-01-09 04:15:45,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-01-09 04:15:45,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:45,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:45,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 04:15:45,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 122 proven. 41 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-01-09 04:15:45,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:15:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 122 proven. 41 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-01-09 04:15:45,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494674171] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:15:45,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:15:45,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2025-01-09 04:15:45,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541853294] [2025-01-09 04:15:45,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:15:45,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:15:45,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:45,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:15:45,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:15:45,415 INFO L87 Difference]: Start difference. First operand 818 states and 872 transitions. Second operand has 10 states, 10 states have (on average 25.7) internal successors, (257), 10 states have internal predecessors, (257), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:45,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:45,569 INFO L93 Difference]: Finished difference Result 919 states and 976 transitions. [2025-01-09 04:15:45,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:15:45,569 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 25.7) internal successors, (257), 10 states have internal predecessors, (257), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2025-01-09 04:15:45,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:45,573 INFO L225 Difference]: With dead ends: 919 [2025-01-09 04:15:45,573 INFO L226 Difference]: Without dead ends: 823 [2025-01-09 04:15:45,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 678 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-01-09 04:15:45,573 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 399 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:45,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 2171 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:15:45,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2025-01-09 04:15:45,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 817. [2025-01-09 04:15:45,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 815 states have (on average 1.0625766871165645) internal successors, (866), 815 states have internal predecessors, (866), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 867 transitions. [2025-01-09 04:15:45,595 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 867 transitions. Word has length 337 [2025-01-09 04:15:45,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:45,595 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 867 transitions. [2025-01-09 04:15:45,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.7) internal successors, (257), 10 states have internal predecessors, (257), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:45,596 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 867 transitions. [2025-01-09 04:15:45,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-01-09 04:15:45,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:45,599 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:45,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 04:15:45,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 04:15:45,804 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:45,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:45,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1037055617, now seen corresponding path program 1 times [2025-01-09 04:15:45,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:45,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635525200] [2025-01-09 04:15:45,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:45,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:45,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 04:15:45,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 04:15:45,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:45,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 62 proven. 308 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:15:46,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:46,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635525200] [2025-01-09 04:15:46,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635525200] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:46,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673723191] [2025-01-09 04:15:46,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:46,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:46,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:46,853 INFO L229 MonitoredProcess]: Starting monitored process 10 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 04:15:46,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 04:15:46,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 04:15:47,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 04:15:47,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:47,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:47,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 04:15:47,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 76 proven. 294 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:15:48,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:15:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 16 proven. 354 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:15:48,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673723191] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:15:48,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:15:48,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 35 [2025-01-09 04:15:48,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269889939] [2025-01-09 04:15:48,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:15:48,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 04:15:48,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:48,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 04:15:48,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1099, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 04:15:48,516 INFO L87 Difference]: Start difference. First operand 817 states and 867 transitions. Second operand has 35 states, 35 states have (on average 17.37142857142857) internal successors, (608), 35 states have internal predecessors, (608), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:49,172 INFO L93 Difference]: Finished difference Result 823 states and 873 transitions. [2025-01-09 04:15:49,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 04:15:49,173 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 17.37142857142857) internal successors, (608), 35 states have internal predecessors, (608), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 394 [2025-01-09 04:15:49,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:49,176 INFO L225 Difference]: With dead ends: 823 [2025-01-09 04:15:49,176 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 04:15:49,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 780 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=254, Invalid=2716, Unknown=0, NotChecked=0, Total=2970 [2025-01-09 04:15:49,178 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 760 mSDsluCounter, 9825 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 10308 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:49,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 10308 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:15:49,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 04:15:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 04:15:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 04:15:49,180 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 394 [2025-01-09 04:15:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:49,180 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 04:15:49,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 17.37142857142857) internal successors, (608), 35 states have internal predecessors, (608), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:15:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 04:15:49,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 04:15:49,183 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:15:49,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 04:15:49,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:49,391 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:49,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 04:16:25,818 WARN L286 SmtUtils]: Spent 26.38s on a formula simplification. DAG size of input: 187 DAG size of output: 275 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-01-09 04:16:32,446 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:16:32,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:16:32 BoogieIcfgContainer [2025-01-09 04:16:32,536 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:16:32,536 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:16:32,536 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:16:32,537 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:16:32,537 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:15:28" (3/4) ... [2025-01-09 04:16:32,539 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 04:16:32,547 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2025-01-09 04:16:32,581 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 04:16:32,581 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 04:16:32,582 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 04:16:32,583 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:16:32,756 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:16:32,756 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:16:32,756 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:16:32,757 INFO L158 Benchmark]: Toolchain (without parser) took 65114.24ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 104.4MB in the beginning and 801.0MB in the end (delta: -696.5MB). Peak memory consumption was 952.0MB. Max. memory is 16.1GB. [2025-01-09 04:16:32,757 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 192.9MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:16:32,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.71ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 84.5MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:16:32,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.60ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 81.6MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:16:32,758 INFO L158 Benchmark]: Boogie Preprocessor took 42.62ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 77.8MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:16:32,758 INFO L158 Benchmark]: RCFGBuilder took 803.33ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 96.9MB in the end (delta: -19.1MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2025-01-09 04:16:32,758 INFO L158 Benchmark]: TraceAbstraction took 63730.27ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 96.2MB in the beginning and 817.7MB in the end (delta: -721.6MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-01-09 04:16:32,758 INFO L158 Benchmark]: Witness Printer took 220.20ms. Allocated memory is still 1.8GB. Free memory was 817.7MB in the beginning and 801.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:16:32,759 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 192.9MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.71ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 84.5MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.60ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 81.6MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.62ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 77.8MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 803.33ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 96.9MB in the end (delta: -19.1MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. * TraceAbstraction took 63730.27ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 96.2MB in the beginning and 817.7MB in the end (delta: -721.6MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 220.20ms. Allocated memory is still 1.8GB. Free memory was 817.7MB in the beginning and 801.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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 - PositiveResult [Line: 20]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 261 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.5s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11499 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11499 mSDsluCounter, 49318 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37071 mSDsCounter, 509 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4880 IncrementalHoareTripleChecker+Invalid, 5389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 509 mSolverCounterUnsat, 12247 mSDtfsCounter, 4880 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3354 GetRequests, 3141 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6741occurred in iteration=13, InterpolantAutomatonStates: 183, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 9207 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 5413 NumberOfCodeBlocks, 5413 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 6546 ConstructedInterpolants, 0 QuantifiedInterpolants, 17633 SizeOfPredicates, 32 NumberOfNonLiveVariables, 6242 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 40 InterpolantComputations, 23 PerfectInterpolantSequences, 1964/3602 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0)) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (req_d == 50)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((req_a == 0) && (req_type != 0)) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (51 == req_d)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (req_a == 1))) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (s_run_st != 0)) && (2 <= a)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((s_run_st != 0) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 884]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((s_run_st != 0) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (s_run_st != 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (s_run_st != 0)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 1260]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (s_run_st != 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (s_run_st != 0)) && (req_tt_a == 1)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (m_run_st == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_type != 0))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (s_run_st != 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && (s_run_st != 0)) && (2 <= a)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && (s_run_st != 0)) && (2 <= a)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) - InvariantResult [Line: 1124]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (s_run_st != 0)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && (s_run_st != 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_type != 0))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 500]: Loop Invariant Derived loop invariant: (((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (s_run_st != 0)) && (req_a___0 == 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((((((((((((req_a == 0) && (req_type != 0)) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (51 == req_d)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (req_a == 1))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && (s_run_pc == 0)) && (req_d == 50)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && (s_run_st != 0)) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 643]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_a == 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (s_run_st != 0)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && (s_run_st != 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (0 <= a)) && (1 <= c_m_lock)) && (s_run_st != 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (2 <= c_m_ev))) - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (s_run_st != 0)) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) - InvariantResult [Line: 881]: Location Invariant Derived location invariant: ((((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 293]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (c_req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (1 <= a)) && (2 <= c_m_ev))) || (((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_req_type != 0))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 1006]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) RESULT: Ultimate proved your program to be correct! [2025-01-09 04:16:32,791 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 Writing output log to file Ultimate.log Result: TRUE