./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '77d80771821c1cd45088b62d9d16474928a377618be5caefce4c7c3ebfdda084'] 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/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77d80771821c1cd45088b62d9d16474928a377618be5caefce4c7c3ebfdda084 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:01:21,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:01:21,787 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:01:21,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:01:21,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:01:21,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:01:21,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:01:21,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:01:21,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:01:21,839 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:01:21,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:01:21,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:01:21,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:01:21,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:01:21,841 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:01:21,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:01:21,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:01:21,842 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:01:21,842 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:01:21,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:01:21,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:01:21,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:01:21,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:01:21,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:01:21,843 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:01:21,843 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:01:21,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:01:21,843 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:01:21,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:01:21,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:01:21,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:01:21,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:01:21,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:01:21,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:01:21,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:01:21,845 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:01:21,845 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:01:21,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:01:21,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:01:21,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:01:21,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:01:21,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:01:21,846 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77d80771821c1cd45088b62d9d16474928a377618be5caefce4c7c3ebfdda084 [2024-11-07 00:01:22,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:01:22,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:01:22,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:01:22,212 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:01:22,213 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:01:22,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2024-11-07 00:01:23,641 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:01:23,905 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:01:23,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2024-11-07 00:01:23,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8fe46e03a/ec72149c927e4ebb93f23212c775f43a/FLAGf9dbbb83b [2024-11-07 00:01:23,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8fe46e03a/ec72149c927e4ebb93f23212c775f43a [2024-11-07 00:01:23,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:01:23,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:01:23,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:01:23,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:01:23,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:01:23,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:01:23" (1/1) ... [2024-11-07 00:01:23,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c243d65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:23, skipping insertion in model container [2024-11-07 00:01:23,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:01:23" (1/1) ... [2024-11-07 00:01:23,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:01:24,250 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/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c[11857,11870] [2024-11-07 00:01:24,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:01:24,274 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:01:24,364 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/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c[11857,11870] [2024-11-07 00:01:24,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:01:24,386 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:01:24,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:24 WrapperNode [2024-11-07 00:01:24,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:01:24,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:01:24,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:01:24,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:01:24,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:24" (1/1) ... [2024-11-07 00:01:24,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:24" (1/1) ... [2024-11-07 00:01:24,448 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 424 [2024-11-07 00:01:24,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:01:24,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:01:24,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:01:24,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:01:24,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:24" (1/1) ... [2024-11-07 00:01:24,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:24" (1/1) ... [2024-11-07 00:01:24,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:24" (1/1) ... [2024-11-07 00:01:24,499 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 00:01:24,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:24" (1/1) ... [2024-11-07 00:01:24,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:24" (1/1) ... [2024-11-07 00:01:24,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:24" (1/1) ... [2024-11-07 00:01:24,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:24" (1/1) ... [2024-11-07 00:01:24,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:24" (1/1) ... [2024-11-07 00:01:24,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:24" (1/1) ... [2024-11-07 00:01:24,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:01:24,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:01:24,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:01:24,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:01:24,549 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:24" (1/1) ... [2024-11-07 00:01:24,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:01:24,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:24,587 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 00:01:24,591 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 00:01:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:01:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-11-07 00:01:24,616 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-11-07 00:01:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-07 00:01:24,616 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-07 00:01:24,617 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-11-07 00:01:24,617 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-11-07 00:01:24,617 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-11-07 00:01:24,617 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-11-07 00:01:24,617 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-11-07 00:01:24,617 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-11-07 00:01:24,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:01:24,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:01:24,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:01:24,747 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:01:24,749 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:01:25,402 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-07 00:01:25,402 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:01:25,416 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:01:25,417 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 00:01:25,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:01:25 BoogieIcfgContainer [2024-11-07 00:01:25,417 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:01:25,420 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:01:25,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:01:25,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:01:25,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:01:23" (1/3) ... [2024-11-07 00:01:25,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9a3721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:01:25, skipping insertion in model container [2024-11-07 00:01:25,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:24" (2/3) ... [2024-11-07 00:01:25,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9a3721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:01:25, skipping insertion in model container [2024-11-07 00:01:25,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:01:25" (3/3) ... [2024-11-07 00:01:25,427 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2024-11-07 00:01:25,442 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:01:25,442 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:01:25,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:01:25,510 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;@6be922b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:01:25,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:01:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 135 states have (on average 1.6) internal successors, (216), 139 states have internal predecessors, (216), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 00:01:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 00:01:25,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:25,525 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:25,525 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:25,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:25,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1065054740, now seen corresponding path program 1 times [2024-11-07 00:01:25,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:25,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843913235] [2024-11-07 00:01:25,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:25,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,909 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 00:01:25,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:25,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843913235] [2024-11-07 00:01:25,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843913235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:25,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:25,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:25,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479926333] [2024-11-07 00:01:25,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:25,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:25,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:25,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:25,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:25,947 INFO L87 Difference]: Start difference. First operand has 174 states, 135 states have (on average 1.6) internal successors, (216), 139 states have internal predecessors, (216), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:01:26,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:26,097 INFO L93 Difference]: Finished difference Result 351 states and 596 transitions. [2024-11-07 00:01:26,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:26,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-07 00:01:26,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:26,111 INFO L225 Difference]: With dead ends: 351 [2024-11-07 00:01:26,112 INFO L226 Difference]: Without dead ends: 176 [2024-11-07 00:01:26,120 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 00:01:26,124 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 7 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:26,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 788 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:01:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-07 00:01:26,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-11-07 00:01:26,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.5401459854014599) internal successors, (211), 140 states have internal predecessors, (211), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 00:01:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 275 transitions. [2024-11-07 00:01:26,194 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 275 transitions. Word has length 15 [2024-11-07 00:01:26,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:26,195 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 275 transitions. [2024-11-07 00:01:26,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:01:26,196 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 275 transitions. [2024-11-07 00:01:26,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 00:01:26,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:26,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:26,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:01:26,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:26,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:26,198 INFO L85 PathProgramCache]: Analyzing trace with hash -833908238, now seen corresponding path program 1 times [2024-11-07 00:01:26,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:26,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857897732] [2024-11-07 00:01:26,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:26,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,351 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 00:01:26,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:26,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857897732] [2024-11-07 00:01:26,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857897732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:26,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:26,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:26,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060664730] [2024-11-07 00:01:26,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:26,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:26,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:26,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:26,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:26,353 INFO L87 Difference]: Start difference. First operand 176 states and 275 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:01:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:26,425 INFO L93 Difference]: Finished difference Result 365 states and 573 transitions. [2024-11-07 00:01:26,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:26,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-07 00:01:26,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:26,430 INFO L225 Difference]: With dead ends: 365 [2024-11-07 00:01:26,433 INFO L226 Difference]: Without dead ends: 192 [2024-11-07 00:01:26,434 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 00:01:26,435 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 25 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:26,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 792 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-07 00:01:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2024-11-07 00:01:26,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 151 states have internal predecessors, (225), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 00:01:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 291 transitions. [2024-11-07 00:01:26,474 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 291 transitions. Word has length 16 [2024-11-07 00:01:26,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:26,476 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 291 transitions. [2024-11-07 00:01:26,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:01:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 291 transitions. [2024-11-07 00:01:26,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 00:01:26,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:26,478 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] [2024-11-07 00:01:26,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:01:26,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:26,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:26,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1500387397, now seen corresponding path program 1 times [2024-11-07 00:01:26,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:26,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438410607] [2024-11-07 00:01:26,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:26,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,620 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 00:01:26,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:26,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438410607] [2024-11-07 00:01:26,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438410607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:26,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:26,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:01:26,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173313423] [2024-11-07 00:01:26,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:26,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:01:26,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:26,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:01:26,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:01:26,622 INFO L87 Difference]: Start difference. First operand 189 states and 291 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 00:01:26,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:26,658 INFO L93 Difference]: Finished difference Result 397 states and 619 transitions. [2024-11-07 00:01:26,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:01:26,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-07 00:01:26,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:26,661 INFO L225 Difference]: With dead ends: 397 [2024-11-07 00:01:26,661 INFO L226 Difference]: Without dead ends: 218 [2024-11-07 00:01:26,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:01:26,666 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 22 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:26,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 536 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-07 00:01:26,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 191. [2024-11-07 00:01:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 150 states have (on average 1.5133333333333334) internal successors, (227), 153 states have internal predecessors, (227), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 00:01:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 293 transitions. [2024-11-07 00:01:26,697 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 293 transitions. Word has length 23 [2024-11-07 00:01:26,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:26,697 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 293 transitions. [2024-11-07 00:01:26,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 00:01:26,697 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 293 transitions. [2024-11-07 00:01:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 00:01:26,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:26,699 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] [2024-11-07 00:01:26,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:01:26,699 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:26,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:26,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1777658698, now seen corresponding path program 1 times [2024-11-07 00:01:26,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:26,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303823346] [2024-11-07 00:01:26,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:26,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,838 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 00:01:26,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:26,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303823346] [2024-11-07 00:01:26,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303823346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:26,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:26,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:26,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360217527] [2024-11-07 00:01:26,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:26,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:26,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:26,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:26,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:26,842 INFO L87 Difference]: Start difference. First operand 191 states and 293 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 00:01:26,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:26,907 INFO L93 Difference]: Finished difference Result 427 states and 672 transitions. [2024-11-07 00:01:26,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:26,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-07 00:01:26,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:26,914 INFO L225 Difference]: With dead ends: 427 [2024-11-07 00:01:26,914 INFO L226 Difference]: Without dead ends: 287 [2024-11-07 00:01:26,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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 00:01:26,915 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 117 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:26,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 786 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:26,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-07 00:01:26,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 191. [2024-11-07 00:01:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 150 states have (on average 1.4866666666666666) internal successors, (223), 153 states have internal predecessors, (223), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 00:01:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 289 transitions. [2024-11-07 00:01:26,946 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 289 transitions. Word has length 31 [2024-11-07 00:01:26,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:26,946 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 289 transitions. [2024-11-07 00:01:26,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 00:01:26,947 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 289 transitions. [2024-11-07 00:01:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 00:01:26,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:26,950 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:26,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:01:26,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:26,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:26,951 INFO L85 PathProgramCache]: Analyzing trace with hash 434150205, now seen corresponding path program 1 times [2024-11-07 00:01:26,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:26,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431680562] [2024-11-07 00:01:26,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:26,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:01:27,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:27,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431680562] [2024-11-07 00:01:27,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431680562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:27,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:27,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:01:27,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84068343] [2024-11-07 00:01:27,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:27,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:01:27,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:27,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:01:27,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:27,128 INFO L87 Difference]: Start difference. First operand 191 states and 289 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 00:01:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:27,178 INFO L93 Difference]: Finished difference Result 372 states and 567 transitions. [2024-11-07 00:01:27,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:27,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-07 00:01:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:27,181 INFO L225 Difference]: With dead ends: 372 [2024-11-07 00:01:27,182 INFO L226 Difference]: Without dead ends: 193 [2024-11-07 00:01:27,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:27,186 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:27,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1046 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:27,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-07 00:01:27,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2024-11-07 00:01:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 150 states have (on average 1.48) internal successors, (222), 153 states have internal predecessors, (222), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 00:01:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 288 transitions. [2024-11-07 00:01:27,204 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 288 transitions. Word has length 32 [2024-11-07 00:01:27,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:27,204 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 288 transitions. [2024-11-07 00:01:27,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 00:01:27,204 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 288 transitions. [2024-11-07 00:01:27,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-07 00:01:27,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:27,206 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:27,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:01:27,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:27,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:27,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1414967708, now seen corresponding path program 1 times [2024-11-07 00:01:27,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:27,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876948654] [2024-11-07 00:01:27,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:27,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:01:27,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:27,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876948654] [2024-11-07 00:01:27,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876948654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:27,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490038784] [2024-11-07 00:01:27,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:27,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:27,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:27,354 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 00:01:27,356 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 00:01:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 00:01:27,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:27,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:01:27,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:01:27,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490038784] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:27,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:27,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-07 00:01:27,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925294520] [2024-11-07 00:01:27,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:27,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:01:27,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:27,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:01:27,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:27,584 INFO L87 Difference]: Start difference. First operand 191 states and 288 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 00:01:27,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:27,652 INFO L93 Difference]: Finished difference Result 430 states and 663 transitions. [2024-11-07 00:01:27,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:27,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2024-11-07 00:01:27,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:27,658 INFO L225 Difference]: With dead ends: 430 [2024-11-07 00:01:27,658 INFO L226 Difference]: Without dead ends: 250 [2024-11-07 00:01:27,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:27,660 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 70 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:27,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 788 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:27,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-07 00:01:27,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2024-11-07 00:01:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 193 states have (on average 1.455958549222798) internal successors, (281), 196 states have internal predecessors, (281), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-07 00:01:27,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 367 transitions. [2024-11-07 00:01:27,681 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 367 transitions. Word has length 35 [2024-11-07 00:01:27,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:27,682 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 367 transitions. [2024-11-07 00:01:27,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 00:01:27,682 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 367 transitions. [2024-11-07 00:01:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 00:01:27,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:27,686 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:27,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 00:01:27,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:27,887 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:27,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:27,887 INFO L85 PathProgramCache]: Analyzing trace with hash -354607524, now seen corresponding path program 2 times [2024-11-07 00:01:27,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:27,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423224337] [2024-11-07 00:01:27,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:27,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-07 00:01:28,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:28,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423224337] [2024-11-07 00:01:28,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423224337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:28,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:28,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:28,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404735972] [2024-11-07 00:01:28,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:28,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:28,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:28,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:28,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:28,020 INFO L87 Difference]: Start difference. First operand 244 states and 367 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 00:01:28,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:28,087 INFO L93 Difference]: Finished difference Result 466 states and 718 transitions. [2024-11-07 00:01:28,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:28,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2024-11-07 00:01:28,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:28,091 INFO L225 Difference]: With dead ends: 466 [2024-11-07 00:01:28,091 INFO L226 Difference]: Without dead ends: 251 [2024-11-07 00:01:28,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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 00:01:28,098 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 8 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:28,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 766 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:28,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-07 00:01:28,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-11-07 00:01:28,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 199 states have (on average 1.4522613065326633) internal successors, (289), 202 states have internal predecessors, (289), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-07 00:01:28,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 375 transitions. [2024-11-07 00:01:28,125 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 375 transitions. Word has length 57 [2024-11-07 00:01:28,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:28,126 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 375 transitions. [2024-11-07 00:01:28,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 00:01:28,126 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 375 transitions. [2024-11-07 00:01:28,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 00:01:28,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:28,127 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:28,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:01:28,128 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:28,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:28,129 INFO L85 PathProgramCache]: Analyzing trace with hash -766519285, now seen corresponding path program 1 times [2024-11-07 00:01:28,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:28,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674692413] [2024-11-07 00:01:28,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:28,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-07 00:01:28,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:28,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674692413] [2024-11-07 00:01:28,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674692413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:28,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:28,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:28,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082189042] [2024-11-07 00:01:28,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:28,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:28,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:28,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:28,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:28,247 INFO L87 Difference]: Start difference. First operand 251 states and 375 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 00:01:28,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:28,319 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2024-11-07 00:01:28,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:28,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2024-11-07 00:01:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:28,322 INFO L225 Difference]: With dead ends: 512 [2024-11-07 00:01:28,322 INFO L226 Difference]: Without dead ends: 290 [2024-11-07 00:01:28,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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 00:01:28,326 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 24 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:28,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 784 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-07 00:01:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2024-11-07 00:01:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 231 states have (on average 1.4112554112554112) internal successors, (326), 234 states have internal predecessors, (326), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 00:01:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 418 transitions. [2024-11-07 00:01:28,349 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 418 transitions. Word has length 57 [2024-11-07 00:01:28,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:28,349 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 418 transitions. [2024-11-07 00:01:28,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 00:01:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 418 transitions. [2024-11-07 00:01:28,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-07 00:01:28,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:28,352 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 00:01:28,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:01:28,352 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:28,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:28,352 INFO L85 PathProgramCache]: Analyzing trace with hash -5352724, now seen corresponding path program 1 times [2024-11-07 00:01:28,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:28,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101732934] [2024-11-07 00:01:28,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:28,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-07 00:01:28,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:28,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101732934] [2024-11-07 00:01:28,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101732934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:28,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:28,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:01:28,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88564105] [2024-11-07 00:01:28,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:28,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:01:28,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:28,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:01:28,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:28,505 INFO L87 Difference]: Start difference. First operand 287 states and 418 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 00:01:28,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:28,546 INFO L93 Difference]: Finished difference Result 523 states and 775 transitions. [2024-11-07 00:01:28,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:28,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2024-11-07 00:01:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:28,551 INFO L225 Difference]: With dead ends: 523 [2024-11-07 00:01:28,552 INFO L226 Difference]: Without dead ends: 289 [2024-11-07 00:01:28,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:28,554 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:28,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1045 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:28,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-07 00:01:28,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287. [2024-11-07 00:01:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 231 states have (on average 1.3982683982683983) internal successors, (323), 234 states have internal predecessors, (323), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 00:01:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 415 transitions. [2024-11-07 00:01:28,587 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 415 transitions. Word has length 75 [2024-11-07 00:01:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:28,588 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 415 transitions. [2024-11-07 00:01:28,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 00:01:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 415 transitions. [2024-11-07 00:01:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 00:01:28,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:28,589 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:28,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:01:28,590 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:28,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:28,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1917910261, now seen corresponding path program 1 times [2024-11-07 00:01:28,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:28,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62351545] [2024-11-07 00:01:28,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:28,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,761 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-07 00:01:28,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:28,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62351545] [2024-11-07 00:01:28,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62351545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:28,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:28,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:28,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731529183] [2024-11-07 00:01:28,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:28,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:28,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:28,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:28,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:28,763 INFO L87 Difference]: Start difference. First operand 287 states and 415 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 00:01:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:28,828 INFO L93 Difference]: Finished difference Result 560 states and 831 transitions. [2024-11-07 00:01:28,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:28,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2024-11-07 00:01:28,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:28,833 INFO L225 Difference]: With dead ends: 560 [2024-11-07 00:01:28,833 INFO L226 Difference]: Without dead ends: 331 [2024-11-07 00:01:28,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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 00:01:28,837 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 25 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:28,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 784 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:28,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-07 00:01:28,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 328. [2024-11-07 00:01:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 268 states have (on average 1.3619402985074627) internal successors, (365), 271 states have internal predecessors, (365), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-07 00:01:28,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 463 transitions. [2024-11-07 00:01:28,865 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 463 transitions. Word has length 104 [2024-11-07 00:01:28,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:28,866 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 463 transitions. [2024-11-07 00:01:28,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 00:01:28,866 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 463 transitions. [2024-11-07 00:01:28,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 00:01:28,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:28,868 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:28,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:01:28,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:28,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:28,871 INFO L85 PathProgramCache]: Analyzing trace with hash -20743229, now seen corresponding path program 1 times [2024-11-07 00:01:28,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:28,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782691962] [2024-11-07 00:01:28,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:28,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-11-07 00:01:28,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:28,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782691962] [2024-11-07 00:01:29,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782691962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:29,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:29,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:29,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625425086] [2024-11-07 00:01:29,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:29,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:29,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:29,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:29,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:29,016 INFO L87 Difference]: Start difference. First operand 328 states and 463 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 00:01:29,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:29,070 INFO L93 Difference]: Finished difference Result 586 states and 851 transitions. [2024-11-07 00:01:29,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:29,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 105 [2024-11-07 00:01:29,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:29,073 INFO L225 Difference]: With dead ends: 586 [2024-11-07 00:01:29,073 INFO L226 Difference]: Without dead ends: 322 [2024-11-07 00:01:29,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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 00:01:29,074 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 9 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:29,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 749 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:29,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-07 00:01:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2024-11-07 00:01:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 263 states have (on average 1.3422053231939164) internal successors, (353), 266 states have internal predecessors, (353), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 00:01:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 449 transitions. [2024-11-07 00:01:29,091 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 449 transitions. Word has length 105 [2024-11-07 00:01:29,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:29,091 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 449 transitions. [2024-11-07 00:01:29,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 00:01:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 449 transitions. [2024-11-07 00:01:29,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:01:29,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:29,093 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 00:01:29,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:01:29,093 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:29,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:29,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1679394221, now seen corresponding path program 1 times [2024-11-07 00:01:29,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:29,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186769338] [2024-11-07 00:01:29,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:29,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-11-07 00:01:29,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:29,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186769338] [2024-11-07 00:01:29,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186769338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:29,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:29,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:01:29,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902653477] [2024-11-07 00:01:29,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:29,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:01:29,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:29,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:01:29,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:29,244 INFO L87 Difference]: Start difference. First operand 322 states and 449 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 00:01:29,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:29,278 INFO L93 Difference]: Finished difference Result 561 states and 800 transitions. [2024-11-07 00:01:29,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:29,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 124 [2024-11-07 00:01:29,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:29,282 INFO L225 Difference]: With dead ends: 561 [2024-11-07 00:01:29,282 INFO L226 Difference]: Without dead ends: 324 [2024-11-07 00:01:29,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:29,283 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:29,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1029 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:29,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-07 00:01:29,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2024-11-07 00:01:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 263 states have (on average 1.3307984790874525) internal successors, (350), 266 states have internal predecessors, (350), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 00:01:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 446 transitions. [2024-11-07 00:01:29,314 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 446 transitions. Word has length 124 [2024-11-07 00:01:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:29,314 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 446 transitions. [2024-11-07 00:01:29,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 00:01:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 446 transitions. [2024-11-07 00:01:29,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 00:01:29,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:29,316 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:29,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:01:29,316 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:29,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:29,317 INFO L85 PathProgramCache]: Analyzing trace with hash 851558858, now seen corresponding path program 1 times [2024-11-07 00:01:29,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:29,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797920122] [2024-11-07 00:01:29,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:29,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-11-07 00:01:29,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:29,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797920122] [2024-11-07 00:01:29,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797920122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:29,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:29,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:29,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560885674] [2024-11-07 00:01:29,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:29,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:29,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:29,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:29,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:29,480 INFO L87 Difference]: Start difference. First operand 322 states and 446 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 00:01:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:29,542 INFO L93 Difference]: Finished difference Result 524 states and 760 transitions. [2024-11-07 00:01:29,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:29,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 157 [2024-11-07 00:01:29,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:29,547 INFO L225 Difference]: With dead ends: 524 [2024-11-07 00:01:29,547 INFO L226 Difference]: Without dead ends: 320 [2024-11-07 00:01:29,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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 00:01:29,549 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 7 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:29,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 717 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-07 00:01:29,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2024-11-07 00:01:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 262 states have (on average 1.3282442748091603) internal successors, (348), 265 states have internal predecessors, (348), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-07 00:01:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 442 transitions. [2024-11-07 00:01:29,567 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 442 transitions. Word has length 157 [2024-11-07 00:01:29,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:29,568 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 442 transitions. [2024-11-07 00:01:29,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 00:01:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 442 transitions. [2024-11-07 00:01:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-07 00:01:29,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:29,572 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:29,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:01:29,572 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:29,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:29,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1654746949, now seen corresponding path program 1 times [2024-11-07 00:01:29,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:29,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493210526] [2024-11-07 00:01:29,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:29,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2024-11-07 00:01:29,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:29,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493210526] [2024-11-07 00:01:29,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493210526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:29,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:29,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:29,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156357079] [2024-11-07 00:01:29,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:29,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:29,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:29,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:29,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:29,819 INFO L87 Difference]: Start difference. First operand 320 states and 442 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:01:29,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:29,886 INFO L93 Difference]: Finished difference Result 464 states and 656 transitions. [2024-11-07 00:01:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:29,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 172 [2024-11-07 00:01:29,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:29,890 INFO L225 Difference]: With dead ends: 464 [2024-11-07 00:01:29,890 INFO L226 Difference]: Without dead ends: 303 [2024-11-07 00:01:29,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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 00:01:29,892 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 35 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:29,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 693 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:29,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-07 00:01:29,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2024-11-07 00:01:29,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 248 states have (on average 1.3185483870967742) internal successors, (327), 251 states have internal predecessors, (327), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 00:01:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 415 transitions. [2024-11-07 00:01:29,909 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 415 transitions. Word has length 172 [2024-11-07 00:01:29,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:29,910 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 415 transitions. [2024-11-07 00:01:29,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:01:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 415 transitions. [2024-11-07 00:01:29,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 00:01:29,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:29,912 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:29,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:01:29,913 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:29,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:29,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1848961329, now seen corresponding path program 1 times [2024-11-07 00:01:29,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:29,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127674196] [2024-11-07 00:01:29,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:29,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,121 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2024-11-07 00:01:30,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:30,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127674196] [2024-11-07 00:01:30,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127674196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:30,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:30,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:30,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956977681] [2024-11-07 00:01:30,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:30,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:30,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:30,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:30,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:30,123 INFO L87 Difference]: Start difference. First operand 303 states and 415 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:01:30,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:30,199 INFO L93 Difference]: Finished difference Result 447 states and 629 transitions. [2024-11-07 00:01:30,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:30,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 174 [2024-11-07 00:01:30,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:30,202 INFO L225 Difference]: With dead ends: 447 [2024-11-07 00:01:30,202 INFO L226 Difference]: Without dead ends: 284 [2024-11-07 00:01:30,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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 00:01:30,203 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 30 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:30,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 697 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:30,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-07 00:01:30,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-11-07 00:01:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 232 states have (on average 1.3103448275862069) internal successors, (304), 235 states have internal predecessors, (304), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-07 00:01:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 386 transitions. [2024-11-07 00:01:30,224 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 386 transitions. Word has length 174 [2024-11-07 00:01:30,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:30,226 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 386 transitions. [2024-11-07 00:01:30,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:01:30,227 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 386 transitions. [2024-11-07 00:01:30,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 00:01:30,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:30,229 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:30,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:01:30,229 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:30,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:30,229 INFO L85 PathProgramCache]: Analyzing trace with hash 422240720, now seen corresponding path program 1 times [2024-11-07 00:01:30,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:30,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967866501] [2024-11-07 00:01:30,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:30,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-11-07 00:01:30,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:30,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967866501] [2024-11-07 00:01:30,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967866501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:30,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:30,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:01:30,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692370517] [2024-11-07 00:01:30,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:30,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:01:30,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:30,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:01:30,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:30,452 INFO L87 Difference]: Start difference. First operand 284 states and 386 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 00:01:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:30,484 INFO L93 Difference]: Finished difference Result 427 states and 599 transitions. [2024-11-07 00:01:30,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:30,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 175 [2024-11-07 00:01:30,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:30,487 INFO L225 Difference]: With dead ends: 427 [2024-11-07 00:01:30,488 INFO L226 Difference]: Without dead ends: 284 [2024-11-07 00:01:30,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:30,490 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 0 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:30,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1007 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-07 00:01:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-11-07 00:01:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 232 states have (on average 1.2844827586206897) internal successors, (298), 235 states have internal predecessors, (298), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-07 00:01:30,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 380 transitions. [2024-11-07 00:01:30,507 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 380 transitions. Word has length 175 [2024-11-07 00:01:30,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:30,507 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 380 transitions. [2024-11-07 00:01:30,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 00:01:30,508 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 380 transitions. [2024-11-07 00:01:30,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-07 00:01:30,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:30,509 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:30,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:01:30,510 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:30,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:30,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1608535476, now seen corresponding path program 1 times [2024-11-07 00:01:30,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:30,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447172524] [2024-11-07 00:01:30,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:30,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,708 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-07 00:01:30,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:30,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447172524] [2024-11-07 00:01:30,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447172524] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:30,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874852106] [2024-11-07 00:01:30,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:30,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:30,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:30,713 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 00:01:30,715 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 00:01:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 00:01:30,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-07 00:01:30,993 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-07 00:01:31,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874852106] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:31,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 00:01:31,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2024-11-07 00:01:31,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695473981] [2024-11-07 00:01:31,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:31,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:31,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:31,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:31,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:31,163 INFO L87 Difference]: Start difference. First operand 284 states and 380 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 00:01:31,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:31,211 INFO L93 Difference]: Finished difference Result 448 states and 621 transitions. [2024-11-07 00:01:31,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:31,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 182 [2024-11-07 00:01:31,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:31,214 INFO L225 Difference]: With dead ends: 448 [2024-11-07 00:01:31,214 INFO L226 Difference]: Without dead ends: 263 [2024-11-07 00:01:31,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 388 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 00:01:31,215 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 20 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:31,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 696 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:31,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-07 00:01:31,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-11-07 00:01:31,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 214 states have (on average 1.2757009345794392) internal successors, (273), 217 states have internal predecessors, (273), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 00:01:31,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 349 transitions. [2024-11-07 00:01:31,232 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 349 transitions. Word has length 182 [2024-11-07 00:01:31,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:31,232 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 349 transitions. [2024-11-07 00:01:31,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 00:01:31,232 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 349 transitions. [2024-11-07 00:01:31,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 00:01:31,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:31,234 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:31,256 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 00:01:31,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 00:01:31,435 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:31,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:31,436 INFO L85 PathProgramCache]: Analyzing trace with hash -652430721, now seen corresponding path program 1 times [2024-11-07 00:01:31,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:31,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171059709] [2024-11-07 00:01:31,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:31,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-07 00:01:31,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:31,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171059709] [2024-11-07 00:01:31,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171059709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:31,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:31,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:31,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096703867] [2024-11-07 00:01:31,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:31,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:31,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:31,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:31,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:31,633 INFO L87 Difference]: Start difference. First operand 263 states and 349 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 00:01:31,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:31,672 INFO L93 Difference]: Finished difference Result 403 states and 560 transitions. [2024-11-07 00:01:31,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:31,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 206 [2024-11-07 00:01:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:31,677 INFO L225 Difference]: With dead ends: 403 [2024-11-07 00:01:31,677 INFO L226 Difference]: Without dead ends: 267 [2024-11-07 00:01:31,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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 00:01:31,678 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 3 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 737 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 00:01:31,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 737 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:31,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-07 00:01:31,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-11-07 00:01:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 217 states have (on average 1.271889400921659) internal successors, (276), 220 states have internal predecessors, (276), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 00:01:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 352 transitions. [2024-11-07 00:01:31,698 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 352 transitions. Word has length 206 [2024-11-07 00:01:31,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:31,699 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 352 transitions. [2024-11-07 00:01:31,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 00:01:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 352 transitions. [2024-11-07 00:01:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-07 00:01:31,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:31,702 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:31,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:01:31,704 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:31,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:31,704 INFO L85 PathProgramCache]: Analyzing trace with hash 755979014, now seen corresponding path program 1 times [2024-11-07 00:01:31,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:31,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60485234] [2024-11-07 00:01:31,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:31,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-07 00:01:31,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:31,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60485234] [2024-11-07 00:01:31,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60485234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:31,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760334618] [2024-11-07 00:01:31,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:31,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:31,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:31,955 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 00:01:31,957 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 00:01:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 00:01:32,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-07 00:01:32,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:32,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760334618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:32,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:32,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-07 00:01:32,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137740092] [2024-11-07 00:01:32,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:32,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:32,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:32,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:32,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:32,196 INFO L87 Difference]: Start difference. First operand 267 states and 352 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 00:01:32,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:32,245 INFO L93 Difference]: Finished difference Result 412 states and 568 transitions. [2024-11-07 00:01:32,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:32,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 213 [2024-11-07 00:01:32,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:32,249 INFO L225 Difference]: With dead ends: 412 [2024-11-07 00:01:32,249 INFO L226 Difference]: Without dead ends: 272 [2024-11-07 00:01:32,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 248 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 00:01:32,250 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 4 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 739 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 00:01:32,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 739 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:32,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-07 00:01:32,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2024-11-07 00:01:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 221 states have (on average 1.2669683257918551) internal successors, (280), 224 states have internal predecessors, (280), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 00:01:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 356 transitions. [2024-11-07 00:01:32,268 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 356 transitions. Word has length 213 [2024-11-07 00:01:32,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:32,270 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 356 transitions. [2024-11-07 00:01:32,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 00:01:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 356 transitions. [2024-11-07 00:01:32,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-07 00:01:32,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:32,273 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 00:01:32,295 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 00:01:32,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:32,478 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:32,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:32,478 INFO L85 PathProgramCache]: Analyzing trace with hash -375445413, now seen corresponding path program 1 times [2024-11-07 00:01:32,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:32,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009552819] [2024-11-07 00:01:32,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:32,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 00:01:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-07 00:01:32,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:32,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009552819] [2024-11-07 00:01:32,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009552819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:32,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984523731] [2024-11-07 00:01:32,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:32,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:32,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:32,751 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 00:01:32,754 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 00:01:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 00:01:32,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-07 00:01:33,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:33,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984523731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:33,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:33,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-07 00:01:33,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486794737] [2024-11-07 00:01:33,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:33,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:33,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:33,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:33,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:33,004 INFO L87 Difference]: Start difference. First operand 272 states and 356 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 00:01:33,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:33,048 INFO L93 Difference]: Finished difference Result 416 states and 568 transitions. [2024-11-07 00:01:33,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:33,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 221 [2024-11-07 00:01:33,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:33,053 INFO L225 Difference]: With dead ends: 416 [2024-11-07 00:01:33,053 INFO L226 Difference]: Without dead ends: 271 [2024-11-07 00:01:33,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 258 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 00:01:33,056 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 5 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:33,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 729 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-07 00:01:33,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2024-11-07 00:01:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 221 states have (on average 1.253393665158371) internal successors, (277), 223 states have internal predecessors, (277), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-07 00:01:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 351 transitions. [2024-11-07 00:01:33,076 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 351 transitions. Word has length 221 [2024-11-07 00:01:33,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:33,076 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 351 transitions. [2024-11-07 00:01:33,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 00:01:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 351 transitions. [2024-11-07 00:01:33,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-07 00:01:33,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:33,081 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:01:33,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 00:01:33,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:33,281 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:33,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:33,282 INFO L85 PathProgramCache]: Analyzing trace with hash -258706760, now seen corresponding path program 1 times [2024-11-07 00:01:33,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:33,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123634764] [2024-11-07 00:01:33,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:33,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 00:01:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 00:01:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,537 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-11-07 00:01:33,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:33,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123634764] [2024-11-07 00:01:33,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123634764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:33,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:33,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:33,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565923892] [2024-11-07 00:01:33,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:33,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:33,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:33,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:33,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:33,539 INFO L87 Difference]: Start difference. First operand 271 states and 351 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 00:01:33,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:33,894 INFO L93 Difference]: Finished difference Result 414 states and 557 transitions. [2024-11-07 00:01:33,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:33,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 229 [2024-11-07 00:01:33,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:33,898 INFO L225 Difference]: With dead ends: 414 [2024-11-07 00:01:33,899 INFO L226 Difference]: Without dead ends: 270 [2024-11-07 00:01:33,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 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 00:01:33,900 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 59 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:33,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 470 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:01:33,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-07 00:01:33,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2024-11-07 00:01:33,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 221 states have (on average 1.248868778280543) internal successors, (276), 222 states have internal predecessors, (276), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 00:01:33,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 348 transitions. [2024-11-07 00:01:33,934 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 348 transitions. Word has length 229 [2024-11-07 00:01:33,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:33,935 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 348 transitions. [2024-11-07 00:01:33,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 00:01:33,935 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 348 transitions. [2024-11-07 00:01:33,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-07 00:01:33,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:33,939 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:01:33,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 00:01:33,939 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:33,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:33,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1826651825, now seen corresponding path program 1 times [2024-11-07 00:01:33,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:33,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988513362] [2024-11-07 00:01:33,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:33,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 00:01:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 00:01:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-11-07 00:01:34,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:34,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988513362] [2024-11-07 00:01:34,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988513362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:34,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:34,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:01:34,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925347878] [2024-11-07 00:01:34,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:34,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:01:34,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:34,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:01:34,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:34,292 INFO L87 Difference]: Start difference. First operand 270 states and 348 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 00:01:34,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:34,834 INFO L93 Difference]: Finished difference Result 619 states and 826 transitions. [2024-11-07 00:01:34,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:01:34,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 230 [2024-11-07 00:01:34,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:34,838 INFO L225 Difference]: With dead ends: 619 [2024-11-07 00:01:34,838 INFO L226 Difference]: Without dead ends: 476 [2024-11-07 00:01:34,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:01:34,840 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 407 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:34,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 617 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:01:34,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-07 00:01:34,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 422. [2024-11-07 00:01:34,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 343 states have (on average 1.2973760932944607) internal successors, (445), 345 states have internal predecessors, (445), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 00:01:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 553 transitions. [2024-11-07 00:01:34,878 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 553 transitions. Word has length 230 [2024-11-07 00:01:34,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:34,879 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 553 transitions. [2024-11-07 00:01:34,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 00:01:34,879 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 553 transitions. [2024-11-07 00:01:34,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-07 00:01:34,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:34,882 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:01:34,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 00:01:34,882 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:34,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:34,882 INFO L85 PathProgramCache]: Analyzing trace with hash -5288995, now seen corresponding path program 1 times [2024-11-07 00:01:34,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:34,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822605858] [2024-11-07 00:01:34,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:34,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 00:01:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 00:01:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-07 00:01:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-07 00:01:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-07 00:01:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-07 00:01:35,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:35,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822605858] [2024-11-07 00:01:35,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822605858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:35,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:35,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:35,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938880604] [2024-11-07 00:01:35,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:35,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:35,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:35,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:35,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:35,219 INFO L87 Difference]: Start difference. First operand 422 states and 553 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 00:01:35,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:35,667 INFO L93 Difference]: Finished difference Result 890 states and 1219 transitions. [2024-11-07 00:01:35,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:35,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 259 [2024-11-07 00:01:35,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:35,672 INFO L225 Difference]: With dead ends: 890 [2024-11-07 00:01:35,672 INFO L226 Difference]: Without dead ends: 663 [2024-11-07 00:01:35,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:35,674 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 216 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:35,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 466 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:01:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-11-07 00:01:35,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 501. [2024-11-07 00:01:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 412 states have (on average 1.3058252427184467) internal successors, (538), 415 states have internal predecessors, (538), 59 states have call successors, (59), 29 states have call predecessors, (59), 29 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2024-11-07 00:01:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 656 transitions. [2024-11-07 00:01:35,724 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 656 transitions. Word has length 259 [2024-11-07 00:01:35,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:35,724 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 656 transitions. [2024-11-07 00:01:35,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 00:01:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 656 transitions. [2024-11-07 00:01:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-07 00:01:35,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:35,728 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:01:35,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 00:01:35,728 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:35,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:35,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1718748118, now seen corresponding path program 1 times [2024-11-07 00:01:35,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:35,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649262308] [2024-11-07 00:01:35,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:35,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 00:01:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 00:01:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-07 00:01:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-07 00:01:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-07 00:01:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-07 00:01:35,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:35,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649262308] [2024-11-07 00:01:35,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649262308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:35,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:35,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:35,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234779769] [2024-11-07 00:01:35,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:35,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:35,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:35,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:35,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:35,960 INFO L87 Difference]: Start difference. First operand 501 states and 656 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 00:01:36,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:36,453 INFO L93 Difference]: Finished difference Result 1061 states and 1444 transitions. [2024-11-07 00:01:36,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:36,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 260 [2024-11-07 00:01:36,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:36,462 INFO L225 Difference]: With dead ends: 1061 [2024-11-07 00:01:36,462 INFO L226 Difference]: Without dead ends: 784 [2024-11-07 00:01:36,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:36,465 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 217 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:36,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 494 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:01:36,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-07 00:01:36,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 609. [2024-11-07 00:01:36,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 508 states have (on average 1.31496062992126) internal successors, (668), 513 states have internal predecessors, (668), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-07 00:01:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 798 transitions. [2024-11-07 00:01:36,522 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 798 transitions. Word has length 260 [2024-11-07 00:01:36,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:36,523 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 798 transitions. [2024-11-07 00:01:36,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 00:01:36,523 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 798 transitions. [2024-11-07 00:01:36,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-07 00:01:36,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:36,527 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:01:36,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 00:01:36,527 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:36,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:36,527 INFO L85 PathProgramCache]: Analyzing trace with hash -461990696, now seen corresponding path program 1 times [2024-11-07 00:01:36,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:36,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968312153] [2024-11-07 00:01:36,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:36,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 00:01:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 00:01:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 00:01:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-07 00:01:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-07 00:01:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-07 00:01:36,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:36,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968312153] [2024-11-07 00:01:36,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968312153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:36,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:36,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:36,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310572633] [2024-11-07 00:01:36,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:36,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:36,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:36,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:36,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:36,809 INFO L87 Difference]: Start difference. First operand 609 states and 798 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 00:01:37,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:37,305 INFO L93 Difference]: Finished difference Result 1271 states and 1726 transitions. [2024-11-07 00:01:37,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:37,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 261 [2024-11-07 00:01:37,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:37,312 INFO L225 Difference]: With dead ends: 1271 [2024-11-07 00:01:37,312 INFO L226 Difference]: Without dead ends: 918 [2024-11-07 00:01:37,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:37,314 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 217 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:37,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 521 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:01:37,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-11-07 00:01:37,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 715. [2024-11-07 00:01:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 606 states have (on average 1.3267326732673268) internal successors, (804), 615 states have internal predecessors, (804), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-07 00:01:37,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 942 transitions. [2024-11-07 00:01:37,383 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 942 transitions. Word has length 261 [2024-11-07 00:01:37,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:37,383 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 942 transitions. [2024-11-07 00:01:37,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 00:01:37,384 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 942 transitions. [2024-11-07 00:01:37,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-07 00:01:37,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:37,390 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:01:37,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 00:01:37,390 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:37,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:37,391 INFO L85 PathProgramCache]: Analyzing trace with hash -187231082, now seen corresponding path program 1 times [2024-11-07 00:01:37,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:37,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248826594] [2024-11-07 00:01:37,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:37,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 00:01:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 00:01:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 00:01:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-07 00:01:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-07 00:01:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2024-11-07 00:01:37,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:37,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248826594] [2024-11-07 00:01:37,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248826594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:37,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143825525] [2024-11-07 00:01:37,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:37,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:37,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:37,783 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 00:01:37,785 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 00:01:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 00:01:38,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-11-07 00:01:38,074 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:38,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143825525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:38,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:38,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-07 00:01:38,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381504896] [2024-11-07 00:01:38,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:38,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:38,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:38,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:38,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 00:01:38,077 INFO L87 Difference]: Start difference. First operand 715 states and 942 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 00:01:38,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:38,221 INFO L93 Difference]: Finished difference Result 1178 states and 1590 transitions. [2024-11-07 00:01:38,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:38,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 261 [2024-11-07 00:01:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:38,226 INFO L225 Difference]: With dead ends: 1178 [2024-11-07 00:01:38,227 INFO L226 Difference]: Without dead ends: 715 [2024-11-07 00:01:38,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:01:38,230 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 31 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:38,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 664 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:01:38,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-07 00:01:38,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-11-07 00:01:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 606 states have (on average 1.316831683168317) internal successors, (798), 615 states have internal predecessors, (798), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-07 00:01:38,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 936 transitions. [2024-11-07 00:01:38,310 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 936 transitions. Word has length 261 [2024-11-07 00:01:38,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:38,311 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 936 transitions. [2024-11-07 00:01:38,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 00:01:38,311 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 936 transitions. [2024-11-07 00:01:38,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-07 00:01:38,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:38,315 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:01:38,338 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 00:01:38,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-07 00:01:38,516 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:38,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:38,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1951108443, now seen corresponding path program 1 times [2024-11-07 00:01:38,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:38,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675321249] [2024-11-07 00:01:38,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:38,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 00:01:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 00:01:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 00:01:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-07 00:01:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-07 00:01:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2024-11-07 00:01:38,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:38,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675321249] [2024-11-07 00:01:38,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675321249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:38,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18901446] [2024-11-07 00:01:38,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:38,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:38,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:38,874 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 00:01:38,876 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 00:01:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 00:01:39,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:39,169 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2024-11-07 00:01:39,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:39,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18901446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:39,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:39,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-07 00:01:39,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267043821] [2024-11-07 00:01:39,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:39,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:39,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:39,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:39,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 00:01:39,171 INFO L87 Difference]: Start difference. First operand 715 states and 936 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 00:01:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:39,279 INFO L93 Difference]: Finished difference Result 1178 states and 1576 transitions. [2024-11-07 00:01:39,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:39,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 262 [2024-11-07 00:01:39,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:39,285 INFO L225 Difference]: With dead ends: 1178 [2024-11-07 00:01:39,286 INFO L226 Difference]: Without dead ends: 727 [2024-11-07 00:01:39,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:01:39,288 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 7 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:39,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 672 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:39,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-11-07 00:01:39,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2024-11-07 00:01:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 616 states have (on average 1.3181818181818181) internal successors, (812), 625 states have internal predecessors, (812), 69 states have call successors, (69), 41 states have call predecessors, (69), 41 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-07 00:01:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 950 transitions. [2024-11-07 00:01:39,352 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 950 transitions. Word has length 262 [2024-11-07 00:01:39,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:39,357 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 950 transitions. [2024-11-07 00:01:39,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 00:01:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 950 transitions. [2024-11-07 00:01:39,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-07 00:01:39,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:39,360 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:01:39,382 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 00:01:39,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-07 00:01:39,566 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:39,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:39,566 INFO L85 PathProgramCache]: Analyzing trace with hash -981119248, now seen corresponding path program 1 times [2024-11-07 00:01:39,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:39,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474134136] [2024-11-07 00:01:39,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:39,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 00:01:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 00:01:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 00:01:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-07 00:01:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-07 00:01:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,937 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-07 00:01:39,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:39,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474134136] [2024-11-07 00:01:39,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474134136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:39,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:39,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:39,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190968639] [2024-11-07 00:01:39,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:39,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:39,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:39,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:39,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:39,940 INFO L87 Difference]: Start difference. First operand 727 states and 950 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 00:01:40,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:40,291 INFO L93 Difference]: Finished difference Result 1192 states and 1590 transitions. [2024-11-07 00:01:40,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:40,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 263 [2024-11-07 00:01:40,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:40,298 INFO L225 Difference]: With dead ends: 1192 [2024-11-07 00:01:40,299 INFO L226 Difference]: Without dead ends: 707 [2024-11-07 00:01:40,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 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 00:01:40,301 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 59 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:40,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 468 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:01:40,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-07 00:01:40,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2024-11-07 00:01:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 597 states have (on average 1.3031825795644891) internal successors, (778), 605 states have internal predecessors, (778), 69 states have call successors, (69), 41 states have call predecessors, (69), 40 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-07 00:01:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 915 transitions. [2024-11-07 00:01:40,375 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 915 transitions. Word has length 263 [2024-11-07 00:01:40,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:40,375 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 915 transitions. [2024-11-07 00:01:40,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 00:01:40,376 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 915 transitions. [2024-11-07 00:01:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-07 00:01:40,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:40,379 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:01:40,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 00:01:40,379 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:40,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:40,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1800454293, now seen corresponding path program 1 times [2024-11-07 00:01:40,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:40,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050432703] [2024-11-07 00:01:40,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:40,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:01:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:01:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-07 00:01:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-07 00:01:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-07 00:01:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-07 00:01:40,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:40,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050432703] [2024-11-07 00:01:40,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050432703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:40,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:40,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:01:40,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802993873] [2024-11-07 00:01:40,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:40,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:01:40,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:40,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:01:40,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:01:40,905 INFO L87 Difference]: Start difference. First operand 707 states and 915 transitions. Second operand has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 00:01:41,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:41,496 INFO L93 Difference]: Finished difference Result 1020 states and 1392 transitions. [2024-11-07 00:01:41,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:01:41,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 264 [2024-11-07 00:01:41,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:41,507 INFO L225 Difference]: With dead ends: 1020 [2024-11-07 00:01:41,507 INFO L226 Difference]: Without dead ends: 1018 [2024-11-07 00:01:41,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-07 00:01:41,509 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 180 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:41,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1528 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:01:41,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2024-11-07 00:01:41,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 713. [2024-11-07 00:01:41,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 601 states have (on average 1.3011647254575707) internal successors, (782), 610 states have internal predecessors, (782), 70 states have call successors, (70), 42 states have call predecessors, (70), 41 states have return successors, (69), 67 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-07 00:01:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 921 transitions. [2024-11-07 00:01:41,579 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 921 transitions. Word has length 264 [2024-11-07 00:01:41,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:41,582 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 921 transitions. [2024-11-07 00:01:41,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 00:01:41,582 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 921 transitions. [2024-11-07 00:01:41,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-07 00:01:41,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:41,587 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 00:01:41,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 00:01:41,587 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:41,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:41,588 INFO L85 PathProgramCache]: Analyzing trace with hash -241657348, now seen corresponding path program 1 times [2024-11-07 00:01:41,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:41,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418295546] [2024-11-07 00:01:41,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:41,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:01:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:01:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-07 00:01:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-07 00:01:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-07 00:01:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-07 00:01:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-11-07 00:01:42,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:42,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418295546] [2024-11-07 00:01:42,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418295546] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:42,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951391228] [2024-11-07 00:01:42,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:42,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:42,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:42,090 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 00:01:42,092 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 00:01:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 00:01:42,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 251 proven. 33 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-07 00:01:42,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-11-07 00:01:42,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951391228] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:42,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:42,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2024-11-07 00:01:42,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190924596] [2024-11-07 00:01:42,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:42,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 00:01:42,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:42,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 00:01:42,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:01:42,979 INFO L87 Difference]: Start difference. First operand 713 states and 921 transitions. Second operand has 19 states, 19 states have (on average 7.684210526315789) internal successors, (146), 14 states have internal predecessors, (146), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2024-11-07 00:01:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:44,988 INFO L93 Difference]: Finished difference Result 1709 states and 2286 transitions. [2024-11-07 00:01:44,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 00:01:44,989 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.684210526315789) internal successors, (146), 14 states have internal predecessors, (146), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) Word has length 272 [2024-11-07 00:01:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:44,998 INFO L225 Difference]: With dead ends: 1709 [2024-11-07 00:01:44,998 INFO L226 Difference]: Without dead ends: 1258 [2024-11-07 00:01:45,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 585 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 00:01:45,002 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 266 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 3096 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:45,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 3096 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 00:01:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2024-11-07 00:01:45,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 988. [2024-11-07 00:01:45,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 836 states have (on average 1.291866028708134) internal successors, (1080), 846 states have internal predecessors, (1080), 94 states have call successors, (94), 55 states have call predecessors, (94), 57 states have return successors, (98), 93 states have call predecessors, (98), 93 states have call successors, (98) [2024-11-07 00:01:45,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1272 transitions. [2024-11-07 00:01:45,113 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1272 transitions. Word has length 272 [2024-11-07 00:01:45,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:45,115 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1272 transitions. [2024-11-07 00:01:45,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.684210526315789) internal successors, (146), 14 states have internal predecessors, (146), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2024-11-07 00:01:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1272 transitions. [2024-11-07 00:01:45,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-07 00:01:45,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:45,120 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 00:01:45,144 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 00:01:45,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:45,321 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:45,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:45,322 INFO L85 PathProgramCache]: Analyzing trace with hash 719956669, now seen corresponding path program 1 times [2024-11-07 00:01:45,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:45,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062041402] [2024-11-07 00:01:45,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:45,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:01:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:01:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-07 00:01:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-07 00:01:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-07 00:01:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-07 00:01:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,588 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2024-11-07 00:01:45,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:45,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062041402] [2024-11-07 00:01:45,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062041402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:45,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664139391] [2024-11-07 00:01:45,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:45,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:45,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:45,592 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 00:01:45,594 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 00:01:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 00:01:45,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2024-11-07 00:01:45,859 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:45,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664139391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:45,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:45,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-07 00:01:45,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553074060] [2024-11-07 00:01:45,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:45,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:45,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:45,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:45,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:45,862 INFO L87 Difference]: Start difference. First operand 988 states and 1272 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 00:01:45,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:45,977 INFO L93 Difference]: Finished difference Result 1839 states and 2408 transitions. [2024-11-07 00:01:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:45,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 272 [2024-11-07 00:01:45,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:45,984 INFO L225 Difference]: With dead ends: 1839 [2024-11-07 00:01:45,985 INFO L226 Difference]: Without dead ends: 972 [2024-11-07 00:01:45,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 318 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 00:01:45,988 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 4 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:45,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 669 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:45,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2024-11-07 00:01:46,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2024-11-07 00:01:46,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 825 states have (on average 1.28) internal successors, (1056), 835 states have internal predecessors, (1056), 90 states have call successors, (90), 55 states have call predecessors, (90), 56 states have return successors, (93), 88 states have call predecessors, (93), 89 states have call successors, (93) [2024-11-07 00:01:46,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1239 transitions. [2024-11-07 00:01:46,058 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1239 transitions. Word has length 272 [2024-11-07 00:01:46,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:46,059 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1239 transitions. [2024-11-07 00:01:46,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 00:01:46,059 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1239 transitions. [2024-11-07 00:01:46,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-11-07 00:01:46,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:46,064 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 00:01:46,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-07 00:01:46,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:46,265 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:46,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:46,266 INFO L85 PathProgramCache]: Analyzing trace with hash -413206872, now seen corresponding path program 1 times [2024-11-07 00:01:46,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:46,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797325553] [2024-11-07 00:01:46,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:46,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:01:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:01:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 00:01:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-07 00:01:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-07 00:01:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-07 00:01:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-07 00:01:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-07 00:01:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-07 00:01:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-11-07 00:01:46,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:46,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797325553] [2024-11-07 00:01:46,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797325553] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:46,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982451272] [2024-11-07 00:01:46,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:46,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:46,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:46,505 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 00:01:46,507 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 00:01:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 00:01:46,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2024-11-07 00:01:46,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:46,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982451272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:46,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:46,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-07 00:01:46,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275914801] [2024-11-07 00:01:46,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:46,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:46,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:46,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:46,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:46,773 INFO L87 Difference]: Start difference. First operand 972 states and 1239 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 00:01:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:46,870 INFO L93 Difference]: Finished difference Result 1687 states and 2192 transitions. [2024-11-07 00:01:46,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:46,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 275 [2024-11-07 00:01:46,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:46,877 INFO L225 Difference]: With dead ends: 1687 [2024-11-07 00:01:46,877 INFO L226 Difference]: Without dead ends: 827 [2024-11-07 00:01:46,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 321 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 00:01:46,882 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 4 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:46,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 697 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:46,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2024-11-07 00:01:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 827. [2024-11-07 00:01:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 698 states have (on average 1.2793696275071633) internal successors, (893), 708 states have internal predecessors, (893), 81 states have call successors, (81), 48 states have call predecessors, (81), 47 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-07 00:01:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1054 transitions. [2024-11-07 00:01:46,951 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1054 transitions. Word has length 275 [2024-11-07 00:01:46,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:46,952 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1054 transitions. [2024-11-07 00:01:46,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 00:01:46,953 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1054 transitions. [2024-11-07 00:01:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-07 00:01:46,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:46,957 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:01:46,980 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 00:01:47,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:47,159 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:47,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:47,159 INFO L85 PathProgramCache]: Analyzing trace with hash 642796529, now seen corresponding path program 1 times [2024-11-07 00:01:47,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:47,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597669553] [2024-11-07 00:01:47,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:47,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:01:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:01:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-07 00:01:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-07 00:01:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-07 00:01:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-07 00:01:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-07 00:01:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-07 00:01:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2024-11-07 00:01:47,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:47,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597669553] [2024-11-07 00:01:47,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597669553] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:47,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007782726] [2024-11-07 00:01:47,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:47,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:47,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:47,622 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 00:01:47,625 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 00:01:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 00:01:47,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-11-07 00:01:48,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:48,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007782726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:48,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:48,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2024-11-07 00:01:48,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945750916] [2024-11-07 00:01:48,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:48,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 00:01:48,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:48,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 00:01:48,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:01:48,088 INFO L87 Difference]: Start difference. First operand 827 states and 1054 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-07 00:01:48,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:48,794 INFO L93 Difference]: Finished difference Result 2212 states and 2831 transitions. [2024-11-07 00:01:48,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 00:01:48,795 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 287 [2024-11-07 00:01:48,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:48,806 INFO L225 Difference]: With dead ends: 2212 [2024-11-07 00:01:48,806 INFO L226 Difference]: Without dead ends: 1754 [2024-11-07 00:01:48,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2024-11-07 00:01:48,810 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 616 mSDsluCounter, 2212 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:48,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 2576 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:01:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2024-11-07 00:01:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1388. [2024-11-07 00:01:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1161 states have (on average 1.2609819121447028) internal successors, (1464), 1176 states have internal predecessors, (1464), 149 states have call successors, (149), 78 states have call predecessors, (149), 77 states have return successors, (148), 140 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-07 00:01:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1761 transitions. [2024-11-07 00:01:48,955 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1761 transitions. Word has length 287 [2024-11-07 00:01:48,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:48,956 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1761 transitions. [2024-11-07 00:01:48,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-07 00:01:48,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1761 transitions. [2024-11-07 00:01:48,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-07 00:01:48,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:48,960 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:01:48,982 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 00:01:49,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:49,165 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:49,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:49,165 INFO L85 PathProgramCache]: Analyzing trace with hash -346032050, now seen corresponding path program 1 times [2024-11-07 00:01:49,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:49,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244159194] [2024-11-07 00:01:49,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:49,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:01:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:01:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-07 00:01:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-07 00:01:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-07 00:01:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-07 00:01:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-07 00:01:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-07 00:01:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2024-11-07 00:01:49,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:49,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244159194] [2024-11-07 00:01:49,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244159194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:49,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:49,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:01:49,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296313602] [2024-11-07 00:01:49,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:49,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:01:49,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:49,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:01:49,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:01:49,455 INFO L87 Difference]: Start difference. First operand 1388 states and 1761 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-07 00:01:49,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:49,847 INFO L93 Difference]: Finished difference Result 2557 states and 3334 transitions. [2024-11-07 00:01:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:01:49,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 293 [2024-11-07 00:01:49,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:49,857 INFO L225 Difference]: With dead ends: 2557 [2024-11-07 00:01:49,858 INFO L226 Difference]: Without dead ends: 1523 [2024-11-07 00:01:49,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:01:49,861 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 106 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:49,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 655 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:01:49,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2024-11-07 00:01:49,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1481. [2024-11-07 00:01:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1233 states have (on average 1.2725060827250607) internal successors, (1569), 1248 states have internal predecessors, (1569), 170 states have call successors, (170), 78 states have call predecessors, (170), 77 states have return successors, (169), 161 states have call predecessors, (169), 169 states have call successors, (169) [2024-11-07 00:01:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 1908 transitions. [2024-11-07 00:01:50,005 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 1908 transitions. Word has length 293 [2024-11-07 00:01:50,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:50,006 INFO L471 AbstractCegarLoop]: Abstraction has 1481 states and 1908 transitions. [2024-11-07 00:01:50,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-07 00:01:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 1908 transitions. [2024-11-07 00:01:50,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-07 00:01:50,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:50,008 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:01:50,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-07 00:01:50,008 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:50,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:50,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2118520266, now seen corresponding path program 1 times [2024-11-07 00:01:50,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:50,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829344412] [2024-11-07 00:01:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:50,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:01:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:01:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-07 00:01:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-07 00:01:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-07 00:01:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-07 00:01:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-07 00:01:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-07 00:01:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 00:01:50,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:50,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829344412] [2024-11-07 00:01:50,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829344412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:50,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929285537] [2024-11-07 00:01:50,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:50,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:50,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:50,480 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 00:01:50,482 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 00:01:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 00:01:50,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-11-07 00:01:50,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:50,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929285537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:50,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:50,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 12 [2024-11-07 00:01:50,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652713770] [2024-11-07 00:01:50,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:50,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 00:01:50,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:50,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 00:01:50,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:01:50,899 INFO L87 Difference]: Start difference. First operand 1481 states and 1908 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-07 00:01:51,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:51,694 INFO L93 Difference]: Finished difference Result 3493 states and 4501 transitions. [2024-11-07 00:01:51,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 00:01:51,694 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 293 [2024-11-07 00:01:51,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:51,710 INFO L225 Difference]: With dead ends: 3493 [2024-11-07 00:01:51,710 INFO L226 Difference]: Without dead ends: 2367 [2024-11-07 00:01:51,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2024-11-07 00:01:51,716 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 609 mSDsluCounter, 2415 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:51,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 2800 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:01:51,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2024-11-07 00:01:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1708. [2024-11-07 00:01:51,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1423 states have (on average 1.2621222768798313) internal successors, (1796), 1440 states have internal predecessors, (1796), 197 states have call successors, (197), 88 states have call predecessors, (197), 87 states have return successors, (196), 186 states have call predecessors, (196), 196 states have call successors, (196) [2024-11-07 00:01:51,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2189 transitions. [2024-11-07 00:01:51,879 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2189 transitions. Word has length 293 [2024-11-07 00:01:51,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:51,880 INFO L471 AbstractCegarLoop]: Abstraction has 1708 states and 2189 transitions. [2024-11-07 00:01:51,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-07 00:01:51,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2189 transitions. [2024-11-07 00:01:51,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-07 00:01:51,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:51,884 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:01:51,906 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 00:01:52,088 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,SelfDestructingSolverStorable34 [2024-11-07 00:01:52,089 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:52,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:52,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1289392182, now seen corresponding path program 1 times [2024-11-07 00:01:52,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:52,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558886260] [2024-11-07 00:01:52,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:52,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:01:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:01:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-07 00:01:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-07 00:01:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-07 00:01:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-07 00:01:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-07 00:01:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-07 00:01:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,576 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 00:01:52,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:52,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558886260] [2024-11-07 00:01:52,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558886260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:52,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827313562] [2024-11-07 00:01:52,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:52,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:52,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:52,580 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 00:01:52,581 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 00:01:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 00:01:52,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-11-07 00:01:52,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:52,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827313562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:52,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:52,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 12 [2024-11-07 00:01:52,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580157979] [2024-11-07 00:01:52,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:52,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 00:01:52,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:52,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 00:01:52,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:01:52,956 INFO L87 Difference]: Start difference. First operand 1708 states and 2189 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 9 states have internal predecessors, (112), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-07 00:01:53,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:53,667 INFO L93 Difference]: Finished difference Result 3425 states and 4396 transitions. [2024-11-07 00:01:53,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 00:01:53,667 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 9 states have internal predecessors, (112), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 293 [2024-11-07 00:01:53,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:53,679 INFO L225 Difference]: With dead ends: 3425 [2024-11-07 00:01:53,680 INFO L226 Difference]: Without dead ends: 2148 [2024-11-07 00:01:53,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2024-11-07 00:01:53,684 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 598 mSDsluCounter, 2400 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 2769 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:53,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 2769 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:01:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2024-11-07 00:01:53,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 1674. [2024-11-07 00:01:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1399 states have (on average 1.2551822730521802) internal successors, (1756), 1416 states have internal predecessors, (1756), 187 states have call successors, (187), 88 states have call predecessors, (187), 87 states have return successors, (186), 176 states have call predecessors, (186), 186 states have call successors, (186) [2024-11-07 00:01:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2129 transitions. [2024-11-07 00:01:53,822 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2129 transitions. Word has length 293 [2024-11-07 00:01:53,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:53,823 INFO L471 AbstractCegarLoop]: Abstraction has 1674 states and 2129 transitions. [2024-11-07 00:01:53,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 9 states have internal predecessors, (112), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-07 00:01:53,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2129 transitions. [2024-11-07 00:01:53,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-07 00:01:53,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:53,826 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:01:53,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-07 00:01:54,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:54,028 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:54,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:54,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1222506872, now seen corresponding path program 1 times [2024-11-07 00:01:54,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:54,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479206421] [2024-11-07 00:01:54,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:54,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:01:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:01:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-07 00:01:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-07 00:01:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-07 00:01:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-07 00:01:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-07 00:01:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-07 00:01:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2024-11-07 00:01:54,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:54,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479206421] [2024-11-07 00:01:54,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479206421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:54,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:54,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:01:54,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626287752] [2024-11-07 00:01:54,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:54,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:01:54,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:54,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:01:54,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:01:54,295 INFO L87 Difference]: Start difference. First operand 1674 states and 2129 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-07 00:01:54,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:54,960 INFO L93 Difference]: Finished difference Result 2995 states and 3845 transitions. [2024-11-07 00:01:54,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 00:01:54,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 293 [2024-11-07 00:01:54,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:54,970 INFO L225 Difference]: With dead ends: 2995 [2024-11-07 00:01:54,970 INFO L226 Difference]: Without dead ends: 1693 [2024-11-07 00:01:54,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:01:54,975 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 298 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:54,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 680 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:01:54,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2024-11-07 00:01:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1570. [2024-11-07 00:01:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1310 states have (on average 1.2557251908396947) internal successors, (1645), 1326 states have internal predecessors, (1645), 177 states have call successors, (177), 83 states have call predecessors, (177), 82 states have return successors, (176), 167 states have call predecessors, (176), 176 states have call successors, (176) [2024-11-07 00:01:55,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 1998 transitions. [2024-11-07 00:01:55,094 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 1998 transitions. Word has length 293 [2024-11-07 00:01:55,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:55,095 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 1998 transitions. [2024-11-07 00:01:55,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-07 00:01:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 1998 transitions. [2024-11-07 00:01:55,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-11-07 00:01:55,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:55,098 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:01:55,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-07 00:01:55,098 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:55,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:55,099 INFO L85 PathProgramCache]: Analyzing trace with hash 671266223, now seen corresponding path program 1 times [2024-11-07 00:01:55,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:55,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860167812] [2024-11-07 00:01:55,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:55,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:01:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:01:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-07 00:01:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-07 00:01:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-07 00:01:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-07 00:01:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-07 00:01:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-07 00:01:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-07 00:01:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2024-11-07 00:01:55,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:55,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860167812] [2024-11-07 00:01:55,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860167812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:55,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:55,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:01:55,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955553180] [2024-11-07 00:01:55,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:55,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:01:55,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:55,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:01:55,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:55,313 INFO L87 Difference]: Start difference. First operand 1570 states and 1998 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 00:01:56,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:56,069 INFO L93 Difference]: Finished difference Result 2830 states and 3623 transitions. [2024-11-07 00:01:56,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:01:56,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 300 [2024-11-07 00:01:56,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:56,079 INFO L225 Difference]: With dead ends: 2830 [2024-11-07 00:01:56,079 INFO L226 Difference]: Without dead ends: 1625 [2024-11-07 00:01:56,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:01:56,084 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 352 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:56,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1006 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:01:56,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2024-11-07 00:01:56,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1386. [2024-11-07 00:01:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1164 states have (on average 1.2336769759450172) internal successors, (1436), 1172 states have internal predecessors, (1436), 151 states have call successors, (151), 70 states have call predecessors, (151), 70 states have return successors, (151), 143 states have call predecessors, (151), 151 states have call successors, (151) [2024-11-07 00:01:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1738 transitions. [2024-11-07 00:01:56,190 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1738 transitions. Word has length 300 [2024-11-07 00:01:56,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:56,190 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1738 transitions. [2024-11-07 00:01:56,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 00:01:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1738 transitions. [2024-11-07 00:01:56,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-07 00:01:56,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:56,195 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:01:56,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-07 00:01:56,195 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:56,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:56,196 INFO L85 PathProgramCache]: Analyzing trace with hash -427609222, now seen corresponding path program 1 times [2024-11-07 00:01:56,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:56,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530365895] [2024-11-07 00:01:56,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:56,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:01:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:01:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-07 00:01:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-07 00:01:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-07 00:01:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-07 00:01:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-07 00:01:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-07 00:01:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-07 00:01:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-11-07 00:01:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2024-11-07 00:01:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2024-11-07 00:01:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-11-07 00:01:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2024-11-07 00:01:57,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:57,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530365895] [2024-11-07 00:01:57,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530365895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:57,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:57,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 00:01:57,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833552709] [2024-11-07 00:01:57,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:57,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:01:57,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:57,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:01:57,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:01:57,202 INFO L87 Difference]: Start difference. First operand 1386 states and 1738 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 00:01:58,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:58,119 INFO L93 Difference]: Finished difference Result 2824 states and 3571 transitions. [2024-11-07 00:01:58,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 00:01:58,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) Word has length 342 [2024-11-07 00:01:58,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:58,130 INFO L225 Difference]: With dead ends: 2824 [2024-11-07 00:01:58,134 INFO L226 Difference]: Without dead ends: 1810 [2024-11-07 00:01:58,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-07 00:01:58,138 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 134 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:58,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1180 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:01:58,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-11-07 00:01:58,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1548. [2024-11-07 00:01:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1286 states have (on average 1.2332814930015552) internal successors, (1586), 1297 states have internal predecessors, (1586), 170 states have call successors, (170), 82 states have call predecessors, (170), 91 states have return successors, (185), 168 states have call predecessors, (185), 170 states have call successors, (185) [2024-11-07 00:01:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 1941 transitions. [2024-11-07 00:01:58,270 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 1941 transitions. Word has length 342 [2024-11-07 00:01:58,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:58,271 INFO L471 AbstractCegarLoop]: Abstraction has 1548 states and 1941 transitions. [2024-11-07 00:01:58,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 00:01:58,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1941 transitions. [2024-11-07 00:01:58,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-07 00:01:58,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:58,276 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:01:58,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-07 00:01:58,276 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:58,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:58,277 INFO L85 PathProgramCache]: Analyzing trace with hash -624122727, now seen corresponding path program 1 times [2024-11-07 00:01:58,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:58,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768472924] [2024-11-07 00:01:58,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:58,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:01:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:01:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-07 00:01:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-07 00:01:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-07 00:01:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-07 00:01:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-07 00:01:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-07 00:01:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-07 00:01:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-11-07 00:01:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2024-11-07 00:01:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2024-11-07 00:01:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-11-07 00:01:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2024-11-07 00:01:58,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:58,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768472924] [2024-11-07 00:01:58,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768472924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:58,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:58,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:01:58,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224203391] [2024-11-07 00:01:58,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:58,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:01:58,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:58,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:01:58,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:58,530 INFO L87 Difference]: Start difference. First operand 1548 states and 1941 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 00:01:58,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:58,958 INFO L93 Difference]: Finished difference Result 3119 states and 3918 transitions. [2024-11-07 00:01:58,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:01:58,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 342 [2024-11-07 00:01:58,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:58,968 INFO L225 Difference]: With dead ends: 3119 [2024-11-07 00:01:58,968 INFO L226 Difference]: Without dead ends: 1512 [2024-11-07 00:01:58,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:01:58,973 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 97 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:58,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 604 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:01:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-11-07 00:01:59,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-11-07 00:01:59,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1259 states have (on average 1.2025416997617155) internal successors, (1514), 1270 states have internal predecessors, (1514), 170 states have call successors, (170), 82 states have call predecessors, (170), 82 states have return successors, (170), 159 states have call predecessors, (170), 170 states have call successors, (170) [2024-11-07 00:01:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1854 transitions. [2024-11-07 00:01:59,106 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1854 transitions. Word has length 342 [2024-11-07 00:01:59,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:59,107 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1854 transitions. [2024-11-07 00:01:59,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 00:01:59,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1854 transitions. [2024-11-07 00:01:59,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-07 00:01:59,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:59,113 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:01:59,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-07 00:01:59,114 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:59,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:59,114 INFO L85 PathProgramCache]: Analyzing trace with hash -505510017, now seen corresponding path program 1 times [2024-11-07 00:01:59,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:59,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974861530] [2024-11-07 00:01:59,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:59,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:02:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:02:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:02:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:02:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:02:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:02:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:02:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:02:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:02:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:02:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:02:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:02:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:02:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:02:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:02:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:02:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:02:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:02:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:02:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-07 00:02:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-07 00:02:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-07 00:02:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-07 00:02:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-07 00:02:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-07 00:02:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-07 00:02:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-11-07 00:02:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2024-11-07 00:02:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2024-11-07 00:02:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-11-07 00:02:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2024-11-07 00:02:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 51 proven. 53 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2024-11-07 00:02:00,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:00,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974861530] [2024-11-07 00:02:00,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974861530] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:02:00,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201284997] [2024-11-07 00:02:00,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:00,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:02:00,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:02:00,562 INFO L229 MonitoredProcess]: Starting monitored process 14 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 00:02:00,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-07 00:02:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-07 00:02:00,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:02:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 275 proven. 64 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2024-11-07 00:02:01,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:02:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2024-11-07 00:02:02,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201284997] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:02:02,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:02:02,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 12] total 33 [2024-11-07 00:02:02,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597360851] [2024-11-07 00:02:02,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:02:02,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-07 00:02:02,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:02,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-07 00:02:02,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 00:02:02,522 INFO L87 Difference]: Start difference. First operand 1512 states and 1854 transitions. Second operand has 33 states, 32 states have (on average 10.90625) internal successors, (349), 29 states have internal predecessors, (349), 14 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (65), 15 states have call predecessors, (65), 13 states have call successors, (65)