./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.3.prop1-back-serstep.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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/hardware-verification-bv/btor2c-lazyMod.adding.3.prop1-back-serstep.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', '2f62226d73e0e183857d998fb902bf54be9131b3acae6a442e91dae883f96d96'] 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/hardware-verification-bv/btor2c-lazyMod.adding.3.prop1-back-serstep.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 2f62226d73e0e183857d998fb902bf54be9131b3acae6a442e91dae883f96d96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:56:59,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:56:59,784 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 01:56:59,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:56:59,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:56:59,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:56:59,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:56:59,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:56:59,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:56:59,808 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:56:59,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:56:59,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:56:59,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:56:59,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:56:59,809 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:56:59,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:56:59,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:56:59,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:56:59,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:56:59,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:56:59,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:56:59,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:56:59,810 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:56:59,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:56:59,810 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:56:59,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:56:59,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:56:59,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:56:59,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:56:59,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:56:59,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:56:59,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:56:59,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:56:59,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:56:59,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:56:59,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:56:59,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:56:59,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:56:59,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:56:59,812 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f62226d73e0e183857d998fb902bf54be9131b3acae6a442e91dae883f96d96 [2024-11-07 01:57:00,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:57:00,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:57:00,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:57:00,121 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:57:00,121 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:57:00,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.3.prop1-back-serstep.c [2024-11-07 01:57:01,421 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:57:01,738 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:57:01,738 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.3.prop1-back-serstep.c [2024-11-07 01:57:01,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c41cbb8e/9f7becfaf69647178e22ceb11942408f/FLAG69a288a84 [2024-11-07 01:57:01,776 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c41cbb8e/9f7becfaf69647178e22ceb11942408f [2024-11-07 01:57:01,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:57:01,782 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:57:01,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:57:01,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:57:01,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:57:01,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:57:01" (1/1) ... [2024-11-07 01:57:01,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e059c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:01, skipping insertion in model container [2024-11-07 01:57:01,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:57:01" (1/1) ... [2024-11-07 01:57:01,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:57:01,981 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/hardware-verification-bv/btor2c-lazyMod.adding.3.prop1-back-serstep.c[1174,1187] [2024-11-07 01:57:02,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:57:02,161 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:57:02,169 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/hardware-verification-bv/btor2c-lazyMod.adding.3.prop1-back-serstep.c[1174,1187] [2024-11-07 01:57:02,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:57:02,299 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:57:02,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:02 WrapperNode [2024-11-07 01:57:02,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:57:02,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:57:02,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:57:02,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:57:02,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:02" (1/1) ... [2024-11-07 01:57:02,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:02" (1/1) ... [2024-11-07 01:57:02,557 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1949 [2024-11-07 01:57:02,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:57:02,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:57:02,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:57:02,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:57:02,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:02" (1/1) ... [2024-11-07 01:57:02,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:02" (1/1) ... [2024-11-07 01:57:02,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:02" (1/1) ... [2024-11-07 01:57:02,728 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]. [2024-11-07 01:57:02,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:02" (1/1) ... [2024-11-07 01:57:02,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:02" (1/1) ... [2024-11-07 01:57:02,787 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:02" (1/1) ... [2024-11-07 01:57:02,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:02" (1/1) ... [2024-11-07 01:57:02,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:02" (1/1) ... [2024-11-07 01:57:02,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:02" (1/1) ... [2024-11-07 01:57:02,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:57:02,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:57:02,876 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:57:02,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:57:02,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:02" (1/1) ... [2024-11-07 01:57:02,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:57:02,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:57:02,945 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) [2024-11-07 01:57:02,949 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 [2024-11-07 01:57:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:57:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:57:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:57:02,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:57:03,204 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:57:03,206 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:57:05,462 INFO L? ?]: Removed 993 outVars from TransFormulas that were not future-live. [2024-11-07 01:57:05,463 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:57:05,495 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:57:05,499 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 01:57:05,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:57:05 BoogieIcfgContainer [2024-11-07 01:57:05,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:57:05,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:57:05,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:57:05,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:57:05,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:57:01" (1/3) ... [2024-11-07 01:57:05,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a318fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:57:05, skipping insertion in model container [2024-11-07 01:57:05,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:02" (2/3) ... [2024-11-07 01:57:05,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a318fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:57:05, skipping insertion in model container [2024-11-07 01:57:05,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:57:05" (3/3) ... [2024-11-07 01:57:05,508 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.3.prop1-back-serstep.c [2024-11-07 01:57:05,521 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:57:05,522 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 01:57:05,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:57:05,612 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;@2aa39f26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:57:05,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 01:57:05,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 686 states, 684 states have (on average 1.5014619883040936) internal successors, (1027), 685 states have internal predecessors, (1027), 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) [2024-11-07 01:57:05,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 01:57:05,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:05,631 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:05,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:05,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:05,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1356627832, now seen corresponding path program 1 times [2024-11-07 01:57:05,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:05,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120512282] [2024-11-07 01:57:05,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:05,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:06,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:06,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120512282] [2024-11-07 01:57:06,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120512282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:06,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:06,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:57:06,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229274849] [2024-11-07 01:57:06,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:06,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:57:06,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:06,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:57:06,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:06,585 INFO L87 Difference]: Start difference. First operand has 686 states, 684 states have (on average 1.5014619883040936) internal successors, (1027), 685 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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) [2024-11-07 01:57:06,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:06,715 INFO L93 Difference]: Finished difference Result 1325 states and 1987 transitions. [2024-11-07 01:57:06,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:57:06,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-07 01:57:06,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:06,733 INFO L225 Difference]: With dead ends: 1325 [2024-11-07 01:57:06,733 INFO L226 Difference]: Without dead ends: 685 [2024-11-07 01:57:06,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:06,742 INFO L432 NwaCegarLoop]: 1021 mSDtfsCounter, 0 mSDsluCounter, 2036 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3057 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:06,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3057 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:57:06,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-11-07 01:57:06,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2024-11-07 01:57:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 684 states have (on average 1.4985380116959064) internal successors, (1025), 684 states have internal predecessors, (1025), 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) [2024-11-07 01:57:06,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1025 transitions. [2024-11-07 01:57:06,815 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1025 transitions. Word has length 85 [2024-11-07 01:57:06,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:06,816 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1025 transitions. [2024-11-07 01:57:06,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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) [2024-11-07 01:57:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1025 transitions. [2024-11-07 01:57:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 01:57:06,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:06,818 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:06,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:57:06,819 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:06,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:06,819 INFO L85 PathProgramCache]: Analyzing trace with hash 895905841, now seen corresponding path program 1 times [2024-11-07 01:57:06,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:06,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852747200] [2024-11-07 01:57:06,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:06,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:07,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:07,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852747200] [2024-11-07 01:57:07,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852747200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:07,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:07,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:57:07,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994838290] [2024-11-07 01:57:07,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:07,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:57:07,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:07,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:57:07,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:07,142 INFO L87 Difference]: Start difference. First operand 685 states and 1025 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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) [2024-11-07 01:57:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:07,206 INFO L93 Difference]: Finished difference Result 1326 states and 1985 transitions. [2024-11-07 01:57:07,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:57:07,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-07 01:57:07,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:07,212 INFO L225 Difference]: With dead ends: 1326 [2024-11-07 01:57:07,212 INFO L226 Difference]: Without dead ends: 687 [2024-11-07 01:57:07,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:07,215 INFO L432 NwaCegarLoop]: 1021 mSDtfsCounter, 0 mSDsluCounter, 2032 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:07,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3053 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:57:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-07 01:57:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2024-11-07 01:57:07,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 1.4970845481049562) internal successors, (1027), 686 states have internal predecessors, (1027), 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) [2024-11-07 01:57:07,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1027 transitions. [2024-11-07 01:57:07,243 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1027 transitions. Word has length 86 [2024-11-07 01:57:07,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:07,244 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1027 transitions. [2024-11-07 01:57:07,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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) [2024-11-07 01:57:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1027 transitions. [2024-11-07 01:57:07,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 01:57:07,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:07,247 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:07,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:57:07,247 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:07,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:07,248 INFO L85 PathProgramCache]: Analyzing trace with hash 905311873, now seen corresponding path program 1 times [2024-11-07 01:57:07,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:07,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611114099] [2024-11-07 01:57:07,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:07,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:07,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:07,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611114099] [2024-11-07 01:57:07,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611114099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:07,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:07,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:57:07,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146073241] [2024-11-07 01:57:07,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:07,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:57:07,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:07,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:57:07,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:57:07,580 INFO L87 Difference]: Start difference. First operand 687 states and 1027 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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) [2024-11-07 01:57:07,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:07,690 INFO L93 Difference]: Finished difference Result 1955 states and 2926 transitions. [2024-11-07 01:57:07,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:57:07,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-07 01:57:07,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:07,700 INFO L225 Difference]: With dead ends: 1955 [2024-11-07 01:57:07,700 INFO L226 Difference]: Without dead ends: 1314 [2024-11-07 01:57:07,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:57:07,702 INFO L432 NwaCegarLoop]: 1019 mSDtfsCounter, 928 mSDsluCounter, 2984 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 4003 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:07,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 4003 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:57:07,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2024-11-07 01:57:07,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 797. [2024-11-07 01:57:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 796 states have (on average 1.4962311557788945) internal successors, (1191), 796 states have internal predecessors, (1191), 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) [2024-11-07 01:57:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1191 transitions. [2024-11-07 01:57:07,730 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1191 transitions. Word has length 87 [2024-11-07 01:57:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:07,730 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1191 transitions. [2024-11-07 01:57:07,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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) [2024-11-07 01:57:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1191 transitions. [2024-11-07 01:57:07,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2024-11-07 01:57:07,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:07,743 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:07,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:57:07,745 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:07,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:07,746 INFO L85 PathProgramCache]: Analyzing trace with hash 196228026, now seen corresponding path program 1 times [2024-11-07 01:57:07,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:07,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140300347] [2024-11-07 01:57:07,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:07,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-07 01:57:09,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:09,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140300347] [2024-11-07 01:57:09,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140300347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:09,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:09,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:57:09,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748468839] [2024-11-07 01:57:09,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:09,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:57:09,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:09,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:57:09,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:57:09,065 INFO L87 Difference]: Start difference. First operand 797 states and 1191 transitions. Second operand has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 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) [2024-11-07 01:57:09,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:09,117 INFO L93 Difference]: Finished difference Result 1442 states and 2155 transitions. [2024-11-07 01:57:09,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:57:09,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 392 [2024-11-07 01:57:09,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:09,126 INFO L225 Difference]: With dead ends: 1442 [2024-11-07 01:57:09,126 INFO L226 Difference]: Without dead ends: 801 [2024-11-07 01:57:09,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:57:09,128 INFO L432 NwaCegarLoop]: 1021 mSDtfsCounter, 0 mSDsluCounter, 2032 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:09,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3053 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:57:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-11-07 01:57:09,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 797. [2024-11-07 01:57:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 796 states have (on average 1.4962311557788945) internal successors, (1191), 796 states have internal predecessors, (1191), 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) [2024-11-07 01:57:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1191 transitions. [2024-11-07 01:57:09,158 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1191 transitions. Word has length 392 [2024-11-07 01:57:09,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:09,160 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1191 transitions. [2024-11-07 01:57:09,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 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) [2024-11-07 01:57:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1191 transitions. [2024-11-07 01:57:09,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-07 01:57:09,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:09,169 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:09,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:57:09,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:09,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:09,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1597978465, now seen corresponding path program 1 times [2024-11-07 01:57:09,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:09,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594020540] [2024-11-07 01:57:09,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:09,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:10,700 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:10,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:10,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594020540] [2024-11-07 01:57:10,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594020540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:10,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:10,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:57:10,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873463195] [2024-11-07 01:57:10,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:10,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:57:10,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:10,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:57:10,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:10,706 INFO L87 Difference]: Start difference. First operand 797 states and 1191 transitions. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 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) [2024-11-07 01:57:11,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:11,204 INFO L93 Difference]: Finished difference Result 1997 states and 2986 transitions. [2024-11-07 01:57:11,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:57:11,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 393 [2024-11-07 01:57:11,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:11,209 INFO L225 Difference]: With dead ends: 1997 [2024-11-07 01:57:11,210 INFO L226 Difference]: Without dead ends: 797 [2024-11-07 01:57:11,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:57:11,214 INFO L432 NwaCegarLoop]: 1136 mSDtfsCounter, 502 mSDsluCounter, 1903 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 3039 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:11,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 3039 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:57:11,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-07 01:57:11,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2024-11-07 01:57:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 796 states have (on average 1.4949748743718594) internal successors, (1190), 796 states have internal predecessors, (1190), 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) [2024-11-07 01:57:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1190 transitions. [2024-11-07 01:57:11,231 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1190 transitions. Word has length 393 [2024-11-07 01:57:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:11,232 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1190 transitions. [2024-11-07 01:57:11,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 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) [2024-11-07 01:57:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1190 transitions. [2024-11-07 01:57:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2024-11-07 01:57:11,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:11,237 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:11,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:57:11,238 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:11,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:11,238 INFO L85 PathProgramCache]: Analyzing trace with hash 24846299, now seen corresponding path program 1 times [2024-11-07 01:57:11,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:11,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847916586] [2024-11-07 01:57:11,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:11,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-07 01:57:12,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:12,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847916586] [2024-11-07 01:57:12,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847916586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:12,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:12,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:57:12,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990020781] [2024-11-07 01:57:12,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:12,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:57:12,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:12,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:57:12,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:12,204 INFO L87 Difference]: Start difference. First operand 797 states and 1190 transitions. Second operand has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 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) [2024-11-07 01:57:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:12,247 INFO L93 Difference]: Finished difference Result 1446 states and 2159 transitions. [2024-11-07 01:57:12,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:57:12,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 394 [2024-11-07 01:57:12,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:12,252 INFO L225 Difference]: With dead ends: 1446 [2024-11-07 01:57:12,252 INFO L226 Difference]: Without dead ends: 801 [2024-11-07 01:57:12,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:12,256 INFO L432 NwaCegarLoop]: 1020 mSDtfsCounter, 0 mSDsluCounter, 2030 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:12,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3050 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:57:12,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-11-07 01:57:12,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 799. [2024-11-07 01:57:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.493734335839599) internal successors, (1192), 798 states have internal predecessors, (1192), 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) [2024-11-07 01:57:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1192 transitions. [2024-11-07 01:57:12,278 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1192 transitions. Word has length 394 [2024-11-07 01:57:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:12,279 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1192 transitions. [2024-11-07 01:57:12,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 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) [2024-11-07 01:57:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1192 transitions. [2024-11-07 01:57:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2024-11-07 01:57:12,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:12,287 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:12,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:57:12,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:12,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:12,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1884428983, now seen corresponding path program 1 times [2024-11-07 01:57:12,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:12,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769404552] [2024-11-07 01:57:12,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:12,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-07 01:57:13,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:13,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769404552] [2024-11-07 01:57:13,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769404552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:13,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:13,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:57:13,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903401282] [2024-11-07 01:57:13,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:13,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:57:13,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:13,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:57:13,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:57:13,237 INFO L87 Difference]: Start difference. First operand 799 states and 1192 transitions. Second operand has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 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) [2024-11-07 01:57:13,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:13,294 INFO L93 Difference]: Finished difference Result 1454 states and 2169 transitions. [2024-11-07 01:57:13,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:57:13,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 395 [2024-11-07 01:57:13,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:13,300 INFO L225 Difference]: With dead ends: 1454 [2024-11-07 01:57:13,300 INFO L226 Difference]: Without dead ends: 803 [2024-11-07 01:57:13,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:57:13,303 INFO L432 NwaCegarLoop]: 1020 mSDtfsCounter, 0 mSDsluCounter, 3044 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4064 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:13,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4064 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:57:13,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2024-11-07 01:57:13,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 801. [2024-11-07 01:57:13,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 800 states have (on average 1.4925) internal successors, (1194), 800 states have internal predecessors, (1194), 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) [2024-11-07 01:57:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1194 transitions. [2024-11-07 01:57:13,320 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1194 transitions. Word has length 395 [2024-11-07 01:57:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:13,321 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1194 transitions. [2024-11-07 01:57:13,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 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) [2024-11-07 01:57:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1194 transitions. [2024-11-07 01:57:13,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2024-11-07 01:57:13,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:13,328 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:13,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:57:13,328 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:13,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:13,329 INFO L85 PathProgramCache]: Analyzing trace with hash -348725598, now seen corresponding path program 1 times [2024-11-07 01:57:13,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:13,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832338707] [2024-11-07 01:57:13,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:13,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-07 01:57:14,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:14,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832338707] [2024-11-07 01:57:14,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832338707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:14,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:14,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:57:14,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562655956] [2024-11-07 01:57:14,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:14,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:57:14,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:14,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:57:14,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:57:14,240 INFO L87 Difference]: Start difference. First operand 801 states and 1194 transitions. Second operand has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 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) [2024-11-07 01:57:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:14,294 INFO L93 Difference]: Finished difference Result 1462 states and 2179 transitions. [2024-11-07 01:57:14,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:57:14,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 396 [2024-11-07 01:57:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:14,299 INFO L225 Difference]: With dead ends: 1462 [2024-11-07 01:57:14,299 INFO L226 Difference]: Without dead ends: 805 [2024-11-07 01:57:14,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:57:14,301 INFO L432 NwaCegarLoop]: 1020 mSDtfsCounter, 0 mSDsluCounter, 3044 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4064 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:14,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4064 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:57:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-07 01:57:14,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 803. [2024-11-07 01:57:14,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 802 states have (on average 1.4912718204488777) internal successors, (1196), 802 states have internal predecessors, (1196), 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) [2024-11-07 01:57:14,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1196 transitions. [2024-11-07 01:57:14,318 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1196 transitions. Word has length 396 [2024-11-07 01:57:14,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:14,319 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1196 transitions. [2024-11-07 01:57:14,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 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) [2024-11-07 01:57:14,319 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1196 transitions. [2024-11-07 01:57:14,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2024-11-07 01:57:14,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:14,324 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:14,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:57:14,324 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:14,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:14,325 INFO L85 PathProgramCache]: Analyzing trace with hash 766483312, now seen corresponding path program 1 times [2024-11-07 01:57:14,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:14,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284208327] [2024-11-07 01:57:14,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:14,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-07 01:57:14,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:14,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284208327] [2024-11-07 01:57:14,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284208327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:14,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:14,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:57:14,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123225310] [2024-11-07 01:57:14,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:14,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:57:14,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:14,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:57:14,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:14,998 INFO L87 Difference]: Start difference. First operand 803 states and 1196 transitions. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 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) [2024-11-07 01:57:15,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:15,044 INFO L93 Difference]: Finished difference Result 1478 states and 2201 transitions. [2024-11-07 01:57:15,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:57:15,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 397 [2024-11-07 01:57:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:15,050 INFO L225 Difference]: With dead ends: 1478 [2024-11-07 01:57:15,050 INFO L226 Difference]: Without dead ends: 815 [2024-11-07 01:57:15,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:15,052 INFO L432 NwaCegarLoop]: 1020 mSDtfsCounter, 4 mSDsluCounter, 2030 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:15,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3050 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:57:15,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2024-11-07 01:57:15,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 809. [2024-11-07 01:57:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 808 states have (on average 1.49009900990099) internal successors, (1204), 808 states have internal predecessors, (1204), 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) [2024-11-07 01:57:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1204 transitions. [2024-11-07 01:57:15,069 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1204 transitions. Word has length 397 [2024-11-07 01:57:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:15,070 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1204 transitions. [2024-11-07 01:57:15,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 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) [2024-11-07 01:57:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1204 transitions. [2024-11-07 01:57:15,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2024-11-07 01:57:15,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:15,076 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:15,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:57:15,076 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:15,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:15,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1907570352, now seen corresponding path program 1 times [2024-11-07 01:57:15,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:15,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638217690] [2024-11-07 01:57:15,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:15,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:15,734 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 01:57:15,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:15,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638217690] [2024-11-07 01:57:15,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638217690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:15,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:15,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:57:15,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420365333] [2024-11-07 01:57:15,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:15,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:57:15,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:15,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:57:15,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:15,738 INFO L87 Difference]: Start difference. First operand 809 states and 1204 transitions. Second operand has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 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) [2024-11-07 01:57:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:15,780 INFO L93 Difference]: Finished difference Result 1498 states and 2229 transitions. [2024-11-07 01:57:15,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:57:15,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 398 [2024-11-07 01:57:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:15,784 INFO L225 Difference]: With dead ends: 1498 [2024-11-07 01:57:15,785 INFO L226 Difference]: Without dead ends: 821 [2024-11-07 01:57:15,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:15,789 INFO L432 NwaCegarLoop]: 1020 mSDtfsCounter, 4 mSDsluCounter, 2030 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:15,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3050 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:57:15,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-11-07 01:57:15,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 815. [2024-11-07 01:57:15,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 814 states have (on average 1.488943488943489) internal successors, (1212), 814 states have internal predecessors, (1212), 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) [2024-11-07 01:57:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1212 transitions. [2024-11-07 01:57:15,806 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1212 transitions. Word has length 398 [2024-11-07 01:57:15,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:15,807 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1212 transitions. [2024-11-07 01:57:15,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 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) [2024-11-07 01:57:15,807 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1212 transitions. [2024-11-07 01:57:15,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2024-11-07 01:57:15,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:15,812 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:15,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:57:15,813 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:15,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:15,813 INFO L85 PathProgramCache]: Analyzing trace with hash 857671138, now seen corresponding path program 1 times [2024-11-07 01:57:15,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:15,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793788781] [2024-11-07 01:57:15,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:15,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-07 01:57:16,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:16,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793788781] [2024-11-07 01:57:16,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793788781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:16,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:16,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:57:16,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857786409] [2024-11-07 01:57:16,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:16,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:57:16,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:16,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:57:16,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:16,503 INFO L87 Difference]: Start difference. First operand 815 states and 1212 transitions. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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) [2024-11-07 01:57:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:16,540 INFO L93 Difference]: Finished difference Result 1510 states and 2245 transitions. [2024-11-07 01:57:16,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:57:16,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 399 [2024-11-07 01:57:16,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:16,545 INFO L225 Difference]: With dead ends: 1510 [2024-11-07 01:57:16,546 INFO L226 Difference]: Without dead ends: 819 [2024-11-07 01:57:16,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:16,547 INFO L432 NwaCegarLoop]: 1020 mSDtfsCounter, 0 mSDsluCounter, 2030 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:16,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3050 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:57:16,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2024-11-07 01:57:16,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 817. [2024-11-07 01:57:16,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 816 states have (on average 1.4877450980392157) internal successors, (1214), 816 states have internal predecessors, (1214), 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) [2024-11-07 01:57:16,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1214 transitions. [2024-11-07 01:57:16,565 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1214 transitions. Word has length 399 [2024-11-07 01:57:16,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:16,565 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 1214 transitions. [2024-11-07 01:57:16,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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) [2024-11-07 01:57:16,566 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1214 transitions. [2024-11-07 01:57:16,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2024-11-07 01:57:16,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:16,571 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:16,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:57:16,573 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:16,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:16,573 INFO L85 PathProgramCache]: Analyzing trace with hash -2046815689, now seen corresponding path program 1 times [2024-11-07 01:57:16,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:16,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240772645] [2024-11-07 01:57:16,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:16,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:17,259 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-07 01:57:17,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:17,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240772645] [2024-11-07 01:57:17,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240772645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:17,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:17,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:57:17,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683118717] [2024-11-07 01:57:17,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:17,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:57:17,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:17,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:57:17,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:17,261 INFO L87 Difference]: Start difference. First operand 817 states and 1214 transitions. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 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) [2024-11-07 01:57:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:17,307 INFO L93 Difference]: Finished difference Result 1518 states and 2255 transitions. [2024-11-07 01:57:17,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:57:17,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 400 [2024-11-07 01:57:17,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:17,312 INFO L225 Difference]: With dead ends: 1518 [2024-11-07 01:57:17,312 INFO L226 Difference]: Without dead ends: 821 [2024-11-07 01:57:17,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:17,314 INFO L432 NwaCegarLoop]: 1020 mSDtfsCounter, 0 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3044 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:17,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3044 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:57:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-11-07 01:57:17,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 819. [2024-11-07 01:57:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 818 states have (on average 1.4865525672371638) internal successors, (1216), 818 states have internal predecessors, (1216), 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) [2024-11-07 01:57:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1216 transitions. [2024-11-07 01:57:17,332 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1216 transitions. Word has length 400 [2024-11-07 01:57:17,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:17,333 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1216 transitions. [2024-11-07 01:57:17,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 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) [2024-11-07 01:57:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1216 transitions. [2024-11-07 01:57:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-11-07 01:57:17,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:17,339 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:17,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:57:17,340 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:17,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:17,340 INFO L85 PathProgramCache]: Analyzing trace with hash -827473445, now seen corresponding path program 1 times [2024-11-07 01:57:17,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:17,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307560229] [2024-11-07 01:57:17,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:17,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-07 01:57:17,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:17,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307560229] [2024-11-07 01:57:17,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307560229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:17,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:17,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:57:17,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234092248] [2024-11-07 01:57:17,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:17,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:57:17,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:17,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:57:17,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:17,952 INFO L87 Difference]: Start difference. First operand 819 states and 1216 transitions. Second operand has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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) [2024-11-07 01:57:17,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:17,991 INFO L93 Difference]: Finished difference Result 1532 states and 2273 transitions. [2024-11-07 01:57:17,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:57:17,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 401 [2024-11-07 01:57:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:17,996 INFO L225 Difference]: With dead ends: 1532 [2024-11-07 01:57:17,996 INFO L226 Difference]: Without dead ends: 833 [2024-11-07 01:57:17,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:17,998 INFO L432 NwaCegarLoop]: 1020 mSDtfsCounter, 3 mSDsluCounter, 2030 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:17,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3050 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:57:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2024-11-07 01:57:18,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 823. [2024-11-07 01:57:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 822 states have (on average 1.4866180048661801) internal successors, (1222), 822 states have internal predecessors, (1222), 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) [2024-11-07 01:57:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1222 transitions. [2024-11-07 01:57:18,017 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1222 transitions. Word has length 401 [2024-11-07 01:57:18,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:18,018 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1222 transitions. [2024-11-07 01:57:18,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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) [2024-11-07 01:57:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1222 transitions. [2024-11-07 01:57:18,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-11-07 01:57:18,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:18,024 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:18,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:57:18,025 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:18,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:18,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1617450306, now seen corresponding path program 1 times [2024-11-07 01:57:18,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:18,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762620936] [2024-11-07 01:57:18,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:18,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-07 01:57:18,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:18,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762620936] [2024-11-07 01:57:18,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762620936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:18,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:18,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:57:18,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935477013] [2024-11-07 01:57:18,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:18,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:57:18,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:18,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:57:18,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:18,614 INFO L87 Difference]: Start difference. First operand 823 states and 1222 transitions. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 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) [2024-11-07 01:57:18,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:18,660 INFO L93 Difference]: Finished difference Result 1538 states and 2283 transitions. [2024-11-07 01:57:18,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:57:18,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 402 [2024-11-07 01:57:18,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:18,665 INFO L225 Difference]: With dead ends: 1538 [2024-11-07 01:57:18,665 INFO L226 Difference]: Without dead ends: 827 [2024-11-07 01:57:18,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:18,667 INFO L432 NwaCegarLoop]: 1020 mSDtfsCounter, 0 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3044 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:18,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3044 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:57:18,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2024-11-07 01:57:18,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 825. [2024-11-07 01:57:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 824 states have (on average 1.4854368932038835) internal successors, (1224), 824 states have internal predecessors, (1224), 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) [2024-11-07 01:57:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1224 transitions. [2024-11-07 01:57:18,686 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1224 transitions. Word has length 402 [2024-11-07 01:57:18,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:18,687 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1224 transitions. [2024-11-07 01:57:18,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 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) [2024-11-07 01:57:18,687 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1224 transitions. [2024-11-07 01:57:18,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2024-11-07 01:57:18,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:18,693 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:18,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:57:18,693 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:18,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:18,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1694897964, now seen corresponding path program 1 times [2024-11-07 01:57:18,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:18,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995763621] [2024-11-07 01:57:18,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:18,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:19,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:19,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995763621] [2024-11-07 01:57:19,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995763621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:57:19,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597185177] [2024-11-07 01:57:19,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:19,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:57:19,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:57:19,414 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) [2024-11-07 01:57:19,438 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 [2024-11-07 01:57:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:20,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 1703 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 01:57:20,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:57:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:20,459 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:57:20,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597185177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:20,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:57:20,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-07 01:57:20,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632032648] [2024-11-07 01:57:20,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:20,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:57:20,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:20,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:57:20,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:57:20,464 INFO L87 Difference]: Start difference. First operand 825 states and 1224 transitions. Second operand has 6 states, 6 states have (on average 67.16666666666667) internal successors, (403), 6 states have internal predecessors, (403), 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) [2024-11-07 01:57:20,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:20,856 INFO L93 Difference]: Finished difference Result 2086 states and 3082 transitions. [2024-11-07 01:57:20,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:57:20,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 67.16666666666667) internal successors, (403), 6 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 403 [2024-11-07 01:57:20,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:20,862 INFO L225 Difference]: With dead ends: 2086 [2024-11-07 01:57:20,862 INFO L226 Difference]: Without dead ends: 1350 [2024-11-07 01:57:20,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-07 01:57:20,865 INFO L432 NwaCegarLoop]: 1010 mSDtfsCounter, 1044 mSDsluCounter, 3737 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 4747 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:20,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 4747 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:57:20,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2024-11-07 01:57:20,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 825. [2024-11-07 01:57:20,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 824 states have (on average 1.4842233009708738) internal successors, (1223), 824 states have internal predecessors, (1223), 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) [2024-11-07 01:57:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1223 transitions. [2024-11-07 01:57:20,886 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1223 transitions. Word has length 403 [2024-11-07 01:57:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:20,886 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1223 transitions. [2024-11-07 01:57:20,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.16666666666667) internal successors, (403), 6 states have internal predecessors, (403), 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) [2024-11-07 01:57:20,886 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1223 transitions. [2024-11-07 01:57:20,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2024-11-07 01:57:20,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:20,892 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:20,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 01:57:21,092 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,SelfDestructingSolverStorable14 [2024-11-07 01:57:21,093 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:21,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:21,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1935075672, now seen corresponding path program 1 times [2024-11-07 01:57:21,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:21,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946842235] [2024-11-07 01:57:21,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:21,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:21,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:21,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946842235] [2024-11-07 01:57:21,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946842235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:57:21,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880386868] [2024-11-07 01:57:21,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:21,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:57:21,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:57:21,841 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) [2024-11-07 01:57:21,842 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 [2024-11-07 01:57:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:22,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 1706 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 01:57:22,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:57:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 01:57:22,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:57:22,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880386868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:22,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:57:22,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-07 01:57:22,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855521194] [2024-11-07 01:57:22,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:22,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:57:22,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:22,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:57:22,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:57:22,848 INFO L87 Difference]: Start difference. First operand 825 states and 1223 transitions. Second operand has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 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) [2024-11-07 01:57:23,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:23,646 INFO L93 Difference]: Finished difference Result 2049 states and 3036 transitions. [2024-11-07 01:57:23,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:57:23,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 404 [2024-11-07 01:57:23,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:23,653 INFO L225 Difference]: With dead ends: 2049 [2024-11-07 01:57:23,653 INFO L226 Difference]: Without dead ends: 1378 [2024-11-07 01:57:23,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:57:23,654 INFO L432 NwaCegarLoop]: 858 mSDtfsCounter, 933 mSDsluCounter, 3361 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 4219 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:23,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 4219 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:57:23,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-11-07 01:57:23,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 827. [2024-11-07 01:57:23,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 826 states have (on average 1.4818401937046004) internal successors, (1224), 826 states have internal predecessors, (1224), 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) [2024-11-07 01:57:23,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1224 transitions. [2024-11-07 01:57:23,675 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1224 transitions. Word has length 404 [2024-11-07 01:57:23,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:23,675 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1224 transitions. [2024-11-07 01:57:23,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 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) [2024-11-07 01:57:23,675 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1224 transitions. [2024-11-07 01:57:23,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2024-11-07 01:57:23,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:23,679 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:23,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 01:57:23,882 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,SelfDestructingSolverStorable15 [2024-11-07 01:57:23,883 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:23,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:23,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1482703366, now seen corresponding path program 1 times [2024-11-07 01:57:23,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:23,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4519241] [2024-11-07 01:57:23,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:23,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:24,546 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 35 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:24,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:24,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4519241] [2024-11-07 01:57:24,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4519241] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:57:24,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570439803] [2024-11-07 01:57:24,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:24,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:57:24,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:57:24,549 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) [2024-11-07 01:57:24,551 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 [2024-11-07 01:57:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:25,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 1709 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 01:57:25,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:57:25,438 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-07 01:57:25,438 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:57:25,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570439803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:25,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:57:25,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-07 01:57:25,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081887521] [2024-11-07 01:57:25,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:25,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:57:25,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:25,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:57:25,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:57:25,442 INFO L87 Difference]: Start difference. First operand 827 states and 1224 transitions. Second operand has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 6 states have internal predecessors, (398), 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) [2024-11-07 01:57:25,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:25,967 INFO L93 Difference]: Finished difference Result 2077 states and 3076 transitions. [2024-11-07 01:57:25,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:57:25,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 6 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 405 [2024-11-07 01:57:25,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:25,973 INFO L225 Difference]: With dead ends: 2077 [2024-11-07 01:57:25,973 INFO L226 Difference]: Without dead ends: 1390 [2024-11-07 01:57:25,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:57:25,975 INFO L432 NwaCegarLoop]: 859 mSDtfsCounter, 1809 mSDsluCounter, 2620 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1809 SdHoareTripleChecker+Valid, 3479 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:25,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1809 Valid, 3479 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:57:25,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-11-07 01:57:25,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 841. [2024-11-07 01:57:25,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 1.4761904761904763) internal successors, (1240), 840 states have internal predecessors, (1240), 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) [2024-11-07 01:57:25,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1240 transitions. [2024-11-07 01:57:25,995 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1240 transitions. Word has length 405 [2024-11-07 01:57:25,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:25,995 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1240 transitions. [2024-11-07 01:57:25,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 6 states have internal predecessors, (398), 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) [2024-11-07 01:57:25,996 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1240 transitions. [2024-11-07 01:57:25,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2024-11-07 01:57:25,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:25,999 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:26,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 01:57:26,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:57:26,200 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:26,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:26,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1994407883, now seen corresponding path program 1 times [2024-11-07 01:57:26,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:26,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197260545] [2024-11-07 01:57:26,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:26,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 35 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:26,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:26,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197260545] [2024-11-07 01:57:26,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197260545] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:57:26,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599700965] [2024-11-07 01:57:26,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:26,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:57:26,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:57:26,853 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) [2024-11-07 01:57:26,854 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 [2024-11-07 01:57:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:27,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 1712 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 01:57:27,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:57:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:27,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:57:27,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599700965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:27,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:57:27,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-07 01:57:27,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123075453] [2024-11-07 01:57:27,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:27,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:57:27,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:27,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:57:27,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:57:27,804 INFO L87 Difference]: Start difference. First operand 841 states and 1240 transitions. Second operand has 6 states, 6 states have (on average 67.66666666666667) internal successors, (406), 6 states have internal predecessors, (406), 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) [2024-11-07 01:57:28,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:28,177 INFO L93 Difference]: Finished difference Result 2077 states and 3048 transitions. [2024-11-07 01:57:28,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:57:28,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 67.66666666666667) internal successors, (406), 6 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 406 [2024-11-07 01:57:28,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:28,183 INFO L225 Difference]: With dead ends: 2077 [2024-11-07 01:57:28,183 INFO L226 Difference]: Without dead ends: 1406 [2024-11-07 01:57:28,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:57:28,184 INFO L432 NwaCegarLoop]: 939 mSDtfsCounter, 1059 mSDsluCounter, 2794 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 3733 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:28,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 3733 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:57:28,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-11-07 01:57:28,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1086. [2024-11-07 01:57:28,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1085 states have (on average 1.4626728110599079) internal successors, (1587), 1085 states have internal predecessors, (1587), 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) [2024-11-07 01:57:28,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1587 transitions. [2024-11-07 01:57:28,205 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1587 transitions. Word has length 406 [2024-11-07 01:57:28,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:28,206 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1587 transitions. [2024-11-07 01:57:28,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.66666666666667) internal successors, (406), 6 states have internal predecessors, (406), 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) [2024-11-07 01:57:28,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1587 transitions. [2024-11-07 01:57:28,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-11-07 01:57:28,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:28,209 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:28,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 01:57:28,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-07 01:57:28,411 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:28,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:28,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1663279086, now seen corresponding path program 1 times [2024-11-07 01:57:28,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:28,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900236989] [2024-11-07 01:57:28,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:28,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:29,041 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 35 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:29,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:29,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900236989] [2024-11-07 01:57:29,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900236989] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:57:29,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676253892] [2024-11-07 01:57:29,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:29,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:57:29,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:57:29,045 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) [2024-11-07 01:57:29,046 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 [2024-11-07 01:57:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:29,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 1715 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 01:57:29,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:57:30,347 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:30,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:57:30,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676253892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:30,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:57:30,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-07 01:57:30,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705321753] [2024-11-07 01:57:30,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:30,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:57:30,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:30,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:57:30,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:57:30,350 INFO L87 Difference]: Start difference. First operand 1086 states and 1587 transitions. Second operand has 6 states, 6 states have (on average 67.83333333333333) internal successors, (407), 6 states have internal predecessors, (407), 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) [2024-11-07 01:57:30,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:30,999 INFO L93 Difference]: Finished difference Result 2160 states and 3174 transitions. [2024-11-07 01:57:31,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:57:31,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 67.83333333333333) internal successors, (407), 6 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 407 [2024-11-07 01:57:31,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:31,004 INFO L225 Difference]: With dead ends: 2160 [2024-11-07 01:57:31,004 INFO L226 Difference]: Without dead ends: 1324 [2024-11-07 01:57:31,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:57:31,006 INFO L432 NwaCegarLoop]: 774 mSDtfsCounter, 1454 mSDsluCounter, 2297 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1454 SdHoareTripleChecker+Valid, 3071 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:31,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1454 Valid, 3071 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:57:31,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2024-11-07 01:57:31,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1322. [2024-11-07 01:57:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1321 states have (on average 1.469341408024224) internal successors, (1941), 1321 states have internal predecessors, (1941), 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) [2024-11-07 01:57:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1941 transitions. [2024-11-07 01:57:31,029 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1941 transitions. Word has length 407 [2024-11-07 01:57:31,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:31,029 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 1941 transitions. [2024-11-07 01:57:31,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.83333333333333) internal successors, (407), 6 states have internal predecessors, (407), 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) [2024-11-07 01:57:31,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1941 transitions. [2024-11-07 01:57:31,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-11-07 01:57:31,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:31,033 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:31,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 01:57:31,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:57:31,235 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:31,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:31,236 INFO L85 PathProgramCache]: Analyzing trace with hash -19151698, now seen corresponding path program 1 times [2024-11-07 01:57:31,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:31,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35523552] [2024-11-07 01:57:31,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:31,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 35 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:31,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:31,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35523552] [2024-11-07 01:57:31,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35523552] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:57:31,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618074736] [2024-11-07 01:57:31,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:31,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:57:31,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:57:31,900 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) [2024-11-07 01:57:31,902 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 [2024-11-07 01:57:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:32,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 1715 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 01:57:32,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:57:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-07 01:57:32,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:57:32,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618074736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:32,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:57:32,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-07 01:57:32,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449255212] [2024-11-07 01:57:32,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:32,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:57:32,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:32,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:57:32,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:57:32,731 INFO L87 Difference]: Start difference. First operand 1322 states and 1941 transitions. Second operand has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 6 states have internal predecessors, (398), 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) [2024-11-07 01:57:33,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:33,167 INFO L93 Difference]: Finished difference Result 3304 states and 4867 transitions. [2024-11-07 01:57:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:57:33,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 6 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 407 [2024-11-07 01:57:33,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:33,172 INFO L225 Difference]: With dead ends: 3304 [2024-11-07 01:57:33,172 INFO L226 Difference]: Without dead ends: 2176 [2024-11-07 01:57:33,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:57:33,174 INFO L432 NwaCegarLoop]: 860 mSDtfsCounter, 1802 mSDsluCounter, 2621 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1802 SdHoareTripleChecker+Valid, 3481 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:33,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1802 Valid, 3481 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:57:33,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2024-11-07 01:57:33,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 1322. [2024-11-07 01:57:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1321 states have (on average 1.4663133989401969) internal successors, (1937), 1321 states have internal predecessors, (1937), 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) [2024-11-07 01:57:33,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1937 transitions. [2024-11-07 01:57:33,202 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1937 transitions. Word has length 407 [2024-11-07 01:57:33,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:33,202 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 1937 transitions. [2024-11-07 01:57:33,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 6 states have internal predecessors, (398), 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) [2024-11-07 01:57:33,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1937 transitions. [2024-11-07 01:57:33,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-07 01:57:33,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:33,206 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:33,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-07 01:57:33,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:57:33,407 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:33,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:33,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2051459967, now seen corresponding path program 1 times [2024-11-07 01:57:33,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:33,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496053558] [2024-11-07 01:57:33,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:33,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 35 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:34,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:34,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496053558] [2024-11-07 01:57:34,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496053558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:57:34,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321186290] [2024-11-07 01:57:34,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:34,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:57:34,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:57:34,025 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) [2024-11-07 01:57:34,026 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 [2024-11-07 01:57:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:34,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 1718 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 01:57:34,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:57:34,907 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:34,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:57:34,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321186290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:34,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:57:34,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-07 01:57:34,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967403543] [2024-11-07 01:57:34,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:34,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:57:34,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:34,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:57:34,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:57:34,909 INFO L87 Difference]: Start difference. First operand 1322 states and 1937 transitions. Second operand has 6 states, 6 states have (on average 68.0) internal successors, (408), 6 states have internal predecessors, (408), 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) [2024-11-07 01:57:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:35,402 INFO L93 Difference]: Finished difference Result 3375 states and 4946 transitions. [2024-11-07 01:57:35,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:57:35,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 68.0) internal successors, (408), 6 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 408 [2024-11-07 01:57:35,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:35,409 INFO L225 Difference]: With dead ends: 3375 [2024-11-07 01:57:35,409 INFO L226 Difference]: Without dead ends: 2303 [2024-11-07 01:57:35,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:57:35,411 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 2058 mSDsluCounter, 2303 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2058 SdHoareTripleChecker+Valid, 3075 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:35,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2058 Valid, 3075 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:57:35,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2303 states. [2024-11-07 01:57:35,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2303 to 1826. [2024-11-07 01:57:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1825 states have (on average 1.4504109589041096) internal successors, (2647), 1825 states have internal predecessors, (2647), 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) [2024-11-07 01:57:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2647 transitions. [2024-11-07 01:57:35,439 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2647 transitions. Word has length 408 [2024-11-07 01:57:35,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:35,439 INFO L471 AbstractCegarLoop]: Abstraction has 1826 states and 2647 transitions. [2024-11-07 01:57:35,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.0) internal successors, (408), 6 states have internal predecessors, (408), 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) [2024-11-07 01:57:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2647 transitions. [2024-11-07 01:57:35,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-07 01:57:35,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:35,444 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:35,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-07 01:57:35,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:57:35,645 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:35,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:35,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1915333596, now seen corresponding path program 1 times [2024-11-07 01:57:35,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:35,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894341288] [2024-11-07 01:57:35,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:35,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 35 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:36,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:36,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894341288] [2024-11-07 01:57:36,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894341288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:57:36,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217969617] [2024-11-07 01:57:36,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:36,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:57:36,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:57:36,212 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) [2024-11-07 01:57:36,214 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 [2024-11-07 01:57:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:36,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 1721 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 01:57:36,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:57:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:37,333 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:57:37,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217969617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:37,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:57:37,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-07 01:57:37,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399827162] [2024-11-07 01:57:37,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:37,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:57:37,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:37,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:57:37,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:57:37,335 INFO L87 Difference]: Start difference. First operand 1826 states and 2647 transitions. Second operand has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 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) [2024-11-07 01:57:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:37,837 INFO L93 Difference]: Finished difference Result 3724 states and 5444 transitions. [2024-11-07 01:57:37,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:57:37,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 409 [2024-11-07 01:57:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:37,844 INFO L225 Difference]: With dead ends: 3724 [2024-11-07 01:57:37,844 INFO L226 Difference]: Without dead ends: 2300 [2024-11-07 01:57:37,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:57:37,847 INFO L432 NwaCegarLoop]: 774 mSDtfsCounter, 1464 mSDsluCounter, 2298 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 3072 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:37,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 3072 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:57:37,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2300 states. [2024-11-07 01:57:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2300 to 2298. [2024-11-07 01:57:37,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2298 states, 2297 states have (on average 1.4606007836308228) internal successors, (3355), 2297 states have internal predecessors, (3355), 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) [2024-11-07 01:57:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 3355 transitions. [2024-11-07 01:57:37,897 INFO L78 Accepts]: Start accepts. Automaton has 2298 states and 3355 transitions. Word has length 409 [2024-11-07 01:57:37,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:37,898 INFO L471 AbstractCegarLoop]: Abstraction has 2298 states and 3355 transitions. [2024-11-07 01:57:37,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 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) [2024-11-07 01:57:37,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 3355 transitions. [2024-11-07 01:57:37,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-07 01:57:37,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:37,903 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:37,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-07 01:57:38,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:57:38,104 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:38,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:38,105 INFO L85 PathProgramCache]: Analyzing trace with hash -869800655, now seen corresponding path program 1 times [2024-11-07 01:57:38,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:38,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958000859] [2024-11-07 01:57:38,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:38,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:38,782 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 35 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:38,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:38,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958000859] [2024-11-07 01:57:38,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958000859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:57:38,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591677552] [2024-11-07 01:57:38,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:38,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:57:38,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:57:38,785 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) [2024-11-07 01:57:38,787 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 [2024-11-07 01:57:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:39,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 1721 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-07 01:57:39,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:57:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:40,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:57:40,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591677552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:40,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:57:40,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [7] total 21 [2024-11-07 01:57:40,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268262556] [2024-11-07 01:57:40,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:40,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 01:57:40,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:40,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 01:57:40,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-07 01:57:40,442 INFO L87 Difference]: Start difference. First operand 2298 states and 3355 transitions. Second operand has 16 states, 16 states have (on average 25.5625) internal successors, (409), 16 states have internal predecessors, (409), 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) [2024-11-07 01:57:42,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:42,197 INFO L93 Difference]: Finished difference Result 6849 states and 10063 transitions. [2024-11-07 01:57:42,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:57:42,198 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 25.5625) internal successors, (409), 16 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 409 [2024-11-07 01:57:42,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:42,214 INFO L225 Difference]: With dead ends: 6849 [2024-11-07 01:57:42,215 INFO L226 Difference]: Without dead ends: 4953 [2024-11-07 01:57:42,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2024-11-07 01:57:42,219 INFO L432 NwaCegarLoop]: 1689 mSDtfsCounter, 2397 mSDsluCounter, 12682 mSDsCounter, 0 mSdLazyCounter, 4153 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2397 SdHoareTripleChecker+Valid, 14371 SdHoareTripleChecker+Invalid, 4159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:42,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2397 Valid, 14371 Invalid, 4159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4153 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:57:42,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4953 states. [2024-11-07 01:57:42,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4953 to 3511. [2024-11-07 01:57:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3511 states, 3510 states have (on average 1.4649572649572649) internal successors, (5142), 3510 states have internal predecessors, (5142), 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) [2024-11-07 01:57:42,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 5142 transitions. [2024-11-07 01:57:42,268 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 5142 transitions. Word has length 409 [2024-11-07 01:57:42,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:42,269 INFO L471 AbstractCegarLoop]: Abstraction has 3511 states and 5142 transitions. [2024-11-07 01:57:42,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 25.5625) internal successors, (409), 16 states have internal predecessors, (409), 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) [2024-11-07 01:57:42,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 5142 transitions. [2024-11-07 01:57:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-11-07 01:57:42,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:42,276 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:42,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-07 01:57:42,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:57:42,477 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:42,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:42,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2045345238, now seen corresponding path program 1 times [2024-11-07 01:57:42,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:42,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129281317] [2024-11-07 01:57:42,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:42,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 35 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:43,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:43,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129281317] [2024-11-07 01:57:43,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129281317] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:57:43,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014770114] [2024-11-07 01:57:43,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:43,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:57:43,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:57:43,046 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:57:43,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-07 01:57:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:43,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 1724 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-07 01:57:43,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:57:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:44,204 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:57:44,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014770114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:44,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:57:44,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2024-11-07 01:57:44,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205885083] [2024-11-07 01:57:44,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:44,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:57:44,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:44,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:57:44,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-07 01:57:44,206 INFO L87 Difference]: Start difference. First operand 3511 states and 5142 transitions. Second operand has 8 states, 8 states have (on average 51.25) internal successors, (410), 8 states have internal predecessors, (410), 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) [2024-11-07 01:57:45,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:45,079 INFO L93 Difference]: Finished difference Result 7999 states and 11756 transitions. [2024-11-07 01:57:45,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 01:57:45,079 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 51.25) internal successors, (410), 8 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 410 [2024-11-07 01:57:45,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:45,085 INFO L225 Difference]: With dead ends: 7999 [2024-11-07 01:57:45,086 INFO L226 Difference]: Without dead ends: 4969 [2024-11-07 01:57:45,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:57:45,089 INFO L432 NwaCegarLoop]: 1252 mSDtfsCounter, 1428 mSDsluCounter, 5753 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 7005 SdHoareTripleChecker+Invalid, 2088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:45,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 7005 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:57:45,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4969 states. [2024-11-07 01:57:45,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4969 to 4551. [2024-11-07 01:57:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4551 states, 4550 states have (on average 1.4646153846153847) internal successors, (6664), 4550 states have internal predecessors, (6664), 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) [2024-11-07 01:57:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4551 states to 4551 states and 6664 transitions. [2024-11-07 01:57:45,131 INFO L78 Accepts]: Start accepts. Automaton has 4551 states and 6664 transitions. Word has length 410 [2024-11-07 01:57:45,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:45,131 INFO L471 AbstractCegarLoop]: Abstraction has 4551 states and 6664 transitions. [2024-11-07 01:57:45,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 51.25) internal successors, (410), 8 states have internal predecessors, (410), 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) [2024-11-07 01:57:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 4551 states and 6664 transitions. [2024-11-07 01:57:45,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-11-07 01:57:45,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:45,141 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:45,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-07 01:57:45,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-07 01:57:45,342 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:45,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:45,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1841786425, now seen corresponding path program 1 times [2024-11-07 01:57:45,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:45,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877301655] [2024-11-07 01:57:45,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:45,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 35 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:45,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:45,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877301655] [2024-11-07 01:57:45,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877301655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:57:45,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6924902] [2024-11-07 01:57:45,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:45,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:57:45,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:57:45,901 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:57:45,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-07 01:57:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:46,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 1724 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-07 01:57:46,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:57:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 49 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:47,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:57:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 55 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:48,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6924902] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:57:48,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:57:48,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16, 15] total 33 [2024-11-07 01:57:48,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050331635] [2024-11-07 01:57:48,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:57:48,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-07 01:57:48,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:48,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-07 01:57:48,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 01:57:48,209 INFO L87 Difference]: Start difference. First operand 4551 states and 6664 transitions. Second operand has 33 states, 33 states have (on average 29.151515151515152) internal successors, (962), 33 states have internal predecessors, (962), 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) [2024-11-07 01:57:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:55,613 INFO L93 Difference]: Finished difference Result 38326 states and 56631 transitions. [2024-11-07 01:57:55,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2024-11-07 01:57:55,614 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 29.151515151515152) internal successors, (962), 33 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 410 [2024-11-07 01:57:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:55,670 INFO L225 Difference]: With dead ends: 38326 [2024-11-07 01:57:55,670 INFO L226 Difference]: Without dead ends: 30274 [2024-11-07 01:57:55,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 968 GetRequests, 800 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9553 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2277, Invalid=26453, Unknown=0, NotChecked=0, Total=28730 [2024-11-07 01:57:55,688 INFO L432 NwaCegarLoop]: 3169 mSDtfsCounter, 8767 mSDsluCounter, 63113 mSDsCounter, 0 mSdLazyCounter, 11967 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8767 SdHoareTripleChecker+Valid, 66282 SdHoareTripleChecker+Invalid, 12093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 11967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:55,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8767 Valid, 66282 Invalid, 12093 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [126 Valid, 11967 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-07 01:57:55,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30274 states. [2024-11-07 01:57:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30274 to 14262. [2024-11-07 01:57:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14262 states, 14261 states have (on average 1.4688310777645326) internal successors, (20947), 14261 states have internal predecessors, (20947), 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) [2024-11-07 01:57:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14262 states to 14262 states and 20947 transitions. [2024-11-07 01:57:55,908 INFO L78 Accepts]: Start accepts. Automaton has 14262 states and 20947 transitions. Word has length 410 [2024-11-07 01:57:55,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:55,909 INFO L471 AbstractCegarLoop]: Abstraction has 14262 states and 20947 transitions. [2024-11-07 01:57:55,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 29.151515151515152) internal successors, (962), 33 states have internal predecessors, (962), 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) [2024-11-07 01:57:55,909 INFO L276 IsEmpty]: Start isEmpty. Operand 14262 states and 20947 transitions. [2024-11-07 01:57:55,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2024-11-07 01:57:55,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:55,932 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:55,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-07 01:57:56,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-07 01:57:56,133 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:56,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:56,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1594190310, now seen corresponding path program 1 times [2024-11-07 01:57:56,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:56,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569453024] [2024-11-07 01:57:56,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:56,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:56,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:56,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569453024] [2024-11-07 01:57:56,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569453024] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:57:56,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38421596] [2024-11-07 01:57:56,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:56,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:57:56,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:57:56,644 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:57:56,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-07 01:57:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:57,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 1727 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 01:57:57,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:57:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 35 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:57,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:57:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 35 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:58,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38421596] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:57:58,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:57:58,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 11] total 27 [2024-11-07 01:57:58,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789242301] [2024-11-07 01:57:58,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:57:58,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 01:57:58,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:58,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 01:57:58,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2024-11-07 01:57:58,645 INFO L87 Difference]: Start difference. First operand 14262 states and 20947 transitions. Second operand has 27 states, 27 states have (on average 40.851851851851855) internal successors, (1103), 27 states have internal predecessors, (1103), 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)