./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.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.1.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', 'd6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647'] 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.1.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 d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:01:20,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:01:20,320 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:20,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:01:20,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:01:20,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:01:20,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:01:20,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:01:20,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:01:20,361 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:01:20,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:01:20,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:01:20,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:01:20,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:01:20,362 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:01:20,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:01:20,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:01:20,364 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:01:20,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:01:20,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:01:20,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:01:20,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:01:20,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:01:20,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:01:20,365 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:01:20,366 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:01:20,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:01:20,366 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:01:20,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:01:20,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:01:20,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:01:20,368 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:01:20,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:01:20,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:01:20,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:01:20,368 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:01:20,368 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:01:20,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:01:20,369 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:01:20,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:01:20,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:01:20,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:01:20,370 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 -> d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 [2024-11-07 00:01:20,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:01:20,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:01:20,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:01:20,729 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:01:20,729 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:01:20,731 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.1.ufo.BOUNDED-10.pals.c [2024-11-07 00:01:22,174 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:01:22,519 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:01:22,521 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2024-11-07 00:01:22,536 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2fac0eadb/97cbbfd74c4e4ce7934b80c8ec226710/FLAG4f0cddcc5 [2024-11-07 00:01:22,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2fac0eadb/97cbbfd74c4e4ce7934b80c8ec226710 [2024-11-07 00:01:22,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:01:22,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:01:22,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:01:22,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:01:22,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:01:22,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:01:22" (1/1) ... [2024-11-07 00:01:22,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f717e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:22, skipping insertion in model container [2024-11-07 00:01:22,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:01:22" (1/1) ... [2024-11-07 00:01:22,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:01:22,836 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.1.ufo.BOUNDED-10.pals.c[11956,11969] [2024-11-07 00:01:22,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:01:22,851 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:01:22,897 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.1.ufo.BOUNDED-10.pals.c[11956,11969] [2024-11-07 00:01:22,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:01:22,919 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:01:22,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:22 WrapperNode [2024-11-07 00:01:22,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:01:22,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:01:22,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:01:22,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:01:22,929 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:22" (1/1) ... [2024-11-07 00:01:22,943 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:22" (1/1) ... [2024-11-07 00:01:22,988 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 427 [2024-11-07 00:01:22,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:01:22,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:01:22,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:01:22,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:01:23,000 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:22" (1/1) ... [2024-11-07 00:01:23,000 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:22" (1/1) ... [2024-11-07 00:01:23,005 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:22" (1/1) ... [2024-11-07 00:01:23,028 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:23,029 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:22" (1/1) ... [2024-11-07 00:01:23,029 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:22" (1/1) ... [2024-11-07 00:01:23,040 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:22" (1/1) ... [2024-11-07 00:01:23,055 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:22" (1/1) ... [2024-11-07 00:01:23,059 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:22" (1/1) ... [2024-11-07 00:01:23,061 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:22" (1/1) ... [2024-11-07 00:01:23,064 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:01:23,066 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:01:23,066 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:01:23,066 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:01:23,067 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:22" (1/1) ... [2024-11-07 00:01:23,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:01:23,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:23,146 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:23,151 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:23,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:01:23,180 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-11-07 00:01:23,180 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-11-07 00:01:23,181 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-07 00:01:23,181 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-07 00:01:23,181 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-11-07 00:01:23,182 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-11-07 00:01:23,182 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-11-07 00:01:23,182 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-11-07 00:01:23,182 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-11-07 00:01:23,182 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-11-07 00:01:23,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:01:23,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:01:23,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:01:23,317 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:01:23,319 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:01:23,926 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-07 00:01:23,926 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:01:23,940 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:01:23,940 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 00:01:23,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:01:23 BoogieIcfgContainer [2024-11-07 00:01:23,941 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:01:23,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:01:23,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:01:23,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:01:23,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:01:22" (1/3) ... [2024-11-07 00:01:23,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a9659b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:01:23, skipping insertion in model container [2024-11-07 00:01:23,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:22" (2/3) ... [2024-11-07 00:01:23,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a9659b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:01:23, skipping insertion in model container [2024-11-07 00:01:23,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:01:23" (3/3) ... [2024-11-07 00:01:23,951 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2024-11-07 00:01:23,966 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:01:23,967 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:01:24,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:01:24,047 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;@774322cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:01:24,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:01:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 136 states have (on average 1.6029411764705883) internal successors, (218), 140 states have internal predecessors, (218), 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:24,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 00:01:24,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:24,060 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:24,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:24,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1581125196, now seen corresponding path program 1 times [2024-11-07 00:01:24,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:24,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943130249] [2024-11-07 00:01:24,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,452 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:24,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:24,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943130249] [2024-11-07 00:01:24,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943130249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:24,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:24,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:24,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704077146] [2024-11-07 00:01:24,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:24,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:24,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:24,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:24,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:24,483 INFO L87 Difference]: Start difference. First operand has 175 states, 136 states have (on average 1.6029411764705883) internal successors, (218), 140 states have internal predecessors, (218), 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:24,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:24,611 INFO L93 Difference]: Finished difference Result 353 states and 600 transitions. [2024-11-07 00:01:24,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:24,618 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:24,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:24,627 INFO L225 Difference]: With dead ends: 353 [2024-11-07 00:01:24,628 INFO L226 Difference]: Without dead ends: 177 [2024-11-07 00:01:24,634 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:24,639 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 7 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 794 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:24,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 794 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:24,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-07 00:01:24,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-07 00:01:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 138 states have (on average 1.5434782608695652) internal successors, (213), 141 states have internal predecessors, (213), 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:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 277 transitions. [2024-11-07 00:01:24,709 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 277 transitions. Word has length 15 [2024-11-07 00:01:24,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:24,709 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 277 transitions. [2024-11-07 00:01:24,710 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:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 277 transitions. [2024-11-07 00:01:24,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 00:01:24,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:24,711 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:24,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:01:24,712 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:24,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:24,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1712914003, now seen corresponding path program 1 times [2024-11-07 00:01:24,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:24,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068861024] [2024-11-07 00:01:24,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:24,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,817 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:24,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:24,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068861024] [2024-11-07 00:01:24,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068861024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:24,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:24,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:24,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460035438] [2024-11-07 00:01:24,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:24,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:24,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:24,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:24,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:24,820 INFO L87 Difference]: Start difference. First operand 177 states and 277 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:24,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:24,890 INFO L93 Difference]: Finished difference Result 367 states and 577 transitions. [2024-11-07 00:01:24,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:24,891 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:24,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:24,894 INFO L225 Difference]: With dead ends: 367 [2024-11-07 00:01:24,894 INFO L226 Difference]: Without dead ends: 193 [2024-11-07 00:01:24,895 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:24,896 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 25 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 798 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:24,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 798 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:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-07 00:01:24,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2024-11-07 00:01:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 149 states have (on average 1.523489932885906) internal successors, (227), 152 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:24,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 293 transitions. [2024-11-07 00:01:24,914 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 293 transitions. Word has length 16 [2024-11-07 00:01:24,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:24,914 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 293 transitions. [2024-11-07 00:01:24,914 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:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 293 transitions. [2024-11-07 00:01:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 00:01:24,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:24,918 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:24,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:01:24,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:24,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:24,921 INFO L85 PathProgramCache]: Analyzing trace with hash -218612603, now seen corresponding path program 1 times [2024-11-07 00:01:24,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:24,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5605526] [2024-11-07 00:01:24,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:24,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,090 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,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:25,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5605526] [2024-11-07 00:01:25,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5605526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:25,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:25,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:01:25,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708156156] [2024-11-07 00:01:25,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:25,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:01:25,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:25,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:01:25,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:01:25,094 INFO L87 Difference]: Start difference. First operand 190 states and 293 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:25,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:25,125 INFO L93 Difference]: Finished difference Result 399 states and 623 transitions. [2024-11-07 00:01:25,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:01:25,125 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:25,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:25,130 INFO L225 Difference]: With dead ends: 399 [2024-11-07 00:01:25,130 INFO L226 Difference]: Without dead ends: 219 [2024-11-07 00:01:25,131 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:25,131 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 22 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 540 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:25,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 540 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:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-07 00:01:25,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 192. [2024-11-07 00:01:25,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 151 states have (on average 1.5165562913907285) internal successors, (229), 154 states have internal predecessors, (229), 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:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 295 transitions. [2024-11-07 00:01:25,160 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 295 transitions. Word has length 23 [2024-11-07 00:01:25,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:25,161 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 295 transitions. [2024-11-07 00:01:25,162 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:25,162 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 295 transitions. [2024-11-07 00:01:25,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 00:01:25,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:25,164 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:25,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:01:25,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:25,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:25,165 INFO L85 PathProgramCache]: Analyzing trace with hash 805469494, now seen corresponding path program 1 times [2024-11-07 00:01:25,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:25,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391417656] [2024-11-07 00:01:25,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:25,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,286 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,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:25,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391417656] [2024-11-07 00:01:25,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391417656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:25,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:25,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:25,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130467777] [2024-11-07 00:01:25,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:25,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:25,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:25,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:25,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:25,291 INFO L87 Difference]: Start difference. First operand 192 states and 295 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:25,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:25,362 INFO L93 Difference]: Finished difference Result 430 states and 678 transitions. [2024-11-07 00:01:25,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:25,364 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:25,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:25,368 INFO L225 Difference]: With dead ends: 430 [2024-11-07 00:01:25,369 INFO L226 Difference]: Without dead ends: 289 [2024-11-07 00:01:25,370 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:25,370 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 119 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 792 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:25,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 792 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:25,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-07 00:01:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2024-11-07 00:01:25,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 151 states have (on average 1.490066225165563) internal successors, (225), 154 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:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 291 transitions. [2024-11-07 00:01:25,403 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 291 transitions. Word has length 31 [2024-11-07 00:01:25,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:25,404 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 291 transitions. [2024-11-07 00:01:25,404 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:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 291 transitions. [2024-11-07 00:01:25,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 00:01:25,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:25,405 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:25,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:01:25,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:25,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:25,405 INFO L85 PathProgramCache]: Analyzing trace with hash -956786536, now seen corresponding path program 1 times [2024-11-07 00:01:25,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:25,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713111965] [2024-11-07 00:01:25,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:25,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,543 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:25,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:25,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713111965] [2024-11-07 00:01:25,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713111965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:25,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:25,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:01:25,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543549071] [2024-11-07 00:01:25,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:25,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:01:25,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:25,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:01:25,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:25,547 INFO L87 Difference]: Start difference. First operand 192 states and 291 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:25,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:25,593 INFO L93 Difference]: Finished difference Result 374 states and 571 transitions. [2024-11-07 00:01:25,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:25,594 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:25,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:25,595 INFO L225 Difference]: With dead ends: 374 [2024-11-07 00:01:25,595 INFO L226 Difference]: Without dead ends: 194 [2024-11-07 00:01:25,596 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:25,597 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 0 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1054 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:25,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1054 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:25,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-07 00:01:25,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2024-11-07 00:01:25,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 151 states have (on average 1.4834437086092715) internal successors, (224), 154 states have internal predecessors, (224), 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:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 290 transitions. [2024-11-07 00:01:25,610 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 290 transitions. Word has length 32 [2024-11-07 00:01:25,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:25,610 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 290 transitions. [2024-11-07 00:01:25,610 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:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 290 transitions. [2024-11-07 00:01:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-07 00:01:25,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:25,614 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:25,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:01:25,614 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:25,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:25,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1412048612, now seen corresponding path program 1 times [2024-11-07 00:01:25,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:25,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451334819] [2024-11-07 00:01:25,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:25,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,731 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:25,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:25,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451334819] [2024-11-07 00:01:25,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451334819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:25,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996228913] [2024-11-07 00:01:25,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:25,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:25,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:25,736 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:25,738 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:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 00:01:25,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:25,913 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:25,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:25,972 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:25,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996228913] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:25,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:25,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-07 00:01:25,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138525354] [2024-11-07 00:01:25,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:25,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:01:25,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:25,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:01:25,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:25,974 INFO L87 Difference]: Start difference. First operand 192 states and 290 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:26,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:26,060 INFO L93 Difference]: Finished difference Result 432 states and 667 transitions. [2024-11-07 00:01:26,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:26,061 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:26,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:26,063 INFO L225 Difference]: With dead ends: 432 [2024-11-07 00:01:26,063 INFO L226 Difference]: Without dead ends: 251 [2024-11-07 00:01:26,063 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:26,064 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 75 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:26,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 788 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:26,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-07 00:01:26,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2024-11-07 00:01:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 194 states have (on average 1.458762886597938) internal successors, (283), 197 states have internal predecessors, (283), 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:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 369 transitions. [2024-11-07 00:01:26,087 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 369 transitions. Word has length 35 [2024-11-07 00:01:26,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:26,087 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 369 transitions. [2024-11-07 00:01:26,087 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:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 369 transitions. [2024-11-07 00:01:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 00:01:26,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:26,090 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:26,109 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:26,291 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:26,291 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:26,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:26,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1166895868, now seen corresponding path program 2 times [2024-11-07 00:01:26,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:26,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745518061] [2024-11-07 00:01:26,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:26,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,416 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:26,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:26,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745518061] [2024-11-07 00:01:26,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745518061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:26,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:26,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:26,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743970796] [2024-11-07 00:01:26,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:26,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:26,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:26,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:26,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:26,420 INFO L87 Difference]: Start difference. First operand 245 states and 369 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:26,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:26,497 INFO L93 Difference]: Finished difference Result 468 states and 722 transitions. [2024-11-07 00:01:26,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:26,497 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:26,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:26,500 INFO L225 Difference]: With dead ends: 468 [2024-11-07 00:01:26,500 INFO L226 Difference]: Without dead ends: 252 [2024-11-07 00:01:26,505 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:26,506 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 8 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 772 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:26,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 772 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:26,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-07 00:01:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2024-11-07 00:01:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 200 states have (on average 1.455) internal successors, (291), 203 states have internal predecessors, (291), 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:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 377 transitions. [2024-11-07 00:01:26,531 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 377 transitions. Word has length 57 [2024-11-07 00:01:26,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:26,533 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 377 transitions. [2024-11-07 00:01:26,533 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:26,533 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 377 transitions. [2024-11-07 00:01:26,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 00:01:26,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:26,534 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:26,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:01:26,535 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:26,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:26,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1021652299, now seen corresponding path program 1 times [2024-11-07 00:01:26,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:26,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424964455] [2024-11-07 00:01:26,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:26,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,657 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:26,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:26,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424964455] [2024-11-07 00:01:26,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424964455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:26,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:26,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:26,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747723892] [2024-11-07 00:01:26,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:26,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:26,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:26,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:26,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:26,658 INFO L87 Difference]: Start difference. First operand 252 states and 377 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:26,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:26,714 INFO L93 Difference]: Finished difference Result 514 states and 780 transitions. [2024-11-07 00:01:26,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:26,716 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:26,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:26,718 INFO L225 Difference]: With dead ends: 514 [2024-11-07 00:01:26,719 INFO L226 Difference]: Without dead ends: 291 [2024-11-07 00:01:26,721 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:26,721 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 24 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 790 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:26,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 790 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:26,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-07 00:01:26,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2024-11-07 00:01:26,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 232 states have (on average 1.4137931034482758) internal successors, (328), 235 states have internal predecessors, (328), 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:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 420 transitions. [2024-11-07 00:01:26,748 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 420 transitions. Word has length 57 [2024-11-07 00:01:26,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:26,748 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 420 transitions. [2024-11-07 00:01:26,749 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:26,749 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 420 transitions. [2024-11-07 00:01:26,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-07 00:01:26,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:26,753 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:26,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:01:26,753 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:26,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:26,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1670828143, now seen corresponding path program 1 times [2024-11-07 00:01:26,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:26,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137249808] [2024-11-07 00:01:26,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:26,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,911 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:26,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:26,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137249808] [2024-11-07 00:01:26,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137249808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:26,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:26,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:01:26,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912757497] [2024-11-07 00:01:26,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:26,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:01:26,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:26,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:01:26,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:26,914 INFO L87 Difference]: Start difference. First operand 288 states and 420 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:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:26,948 INFO L93 Difference]: Finished difference Result 525 states and 779 transitions. [2024-11-07 00:01:26,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:26,949 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:26,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:26,952 INFO L225 Difference]: With dead ends: 525 [2024-11-07 00:01:26,952 INFO L226 Difference]: Without dead ends: 290 [2024-11-07 00:01:26,953 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:26,956 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 0 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1053 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:26,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1053 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:26,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-07 00:01:26,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2024-11-07 00:01:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 232 states have (on average 1.4008620689655173) internal successors, (325), 235 states have internal predecessors, (325), 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:26,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 417 transitions. [2024-11-07 00:01:26,979 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 417 transitions. Word has length 75 [2024-11-07 00:01:26,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:26,979 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 417 transitions. [2024-11-07 00:01:26,980 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:26,980 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 417 transitions. [2024-11-07 00:01:26,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 00:01:26,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:26,981 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:26,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:01:26,981 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:26,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:26,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1243330431, now seen corresponding path program 1 times [2024-11-07 00:01:26,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:26,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73010936] [2024-11-07 00:01:26,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:26,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,158 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:27,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:27,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73010936] [2024-11-07 00:01:27,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73010936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:27,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:27,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:27,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283308448] [2024-11-07 00:01:27,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:27,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:27,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:27,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:27,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:27,159 INFO L87 Difference]: Start difference. First operand 288 states and 417 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:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:27,219 INFO L93 Difference]: Finished difference Result 562 states and 835 transitions. [2024-11-07 00:01:27,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:27,220 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:27,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:27,222 INFO L225 Difference]: With dead ends: 562 [2024-11-07 00:01:27,222 INFO L226 Difference]: Without dead ends: 332 [2024-11-07 00:01:27,223 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:27,224 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 25 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 790 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:27,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 790 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:27,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-07 00:01:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 329. [2024-11-07 00:01:27,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 269 states have (on average 1.3643122676579926) internal successors, (367), 272 states have internal predecessors, (367), 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:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 465 transitions. [2024-11-07 00:01:27,254 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 465 transitions. Word has length 104 [2024-11-07 00:01:27,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:27,255 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 465 transitions. [2024-11-07 00:01:27,255 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:27,255 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 465 transitions. [2024-11-07 00:01:27,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 00:01:27,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:27,256 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:27,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:01:27,256 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:27,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:27,257 INFO L85 PathProgramCache]: Analyzing trace with hash -712190712, now seen corresponding path program 1 times [2024-11-07 00:01:27,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:27,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082201470] [2024-11-07 00:01:27,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:27,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,399 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:27,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:27,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082201470] [2024-11-07 00:01:27,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082201470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:27,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:27,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:27,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480266716] [2024-11-07 00:01:27,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:27,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:27,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:27,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:27,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:27,404 INFO L87 Difference]: Start difference. First operand 329 states and 465 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:27,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:27,465 INFO L93 Difference]: Finished difference Result 588 states and 855 transitions. [2024-11-07 00:01:27,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:27,466 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:27,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:27,469 INFO L225 Difference]: With dead ends: 588 [2024-11-07 00:01:27,469 INFO L226 Difference]: Without dead ends: 323 [2024-11-07 00:01:27,470 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:27,471 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 9 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 755 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:27,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 755 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:27,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-07 00:01:27,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2024-11-07 00:01:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 264 states have (on average 1.3446969696969697) internal successors, (355), 267 states have internal predecessors, (355), 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:27,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 451 transitions. [2024-11-07 00:01:27,500 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 451 transitions. Word has length 105 [2024-11-07 00:01:27,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:27,500 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 451 transitions. [2024-11-07 00:01:27,501 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:27,501 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 451 transitions. [2024-11-07 00:01:27,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:01:27,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:27,503 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:27,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:01:27,503 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:27,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:27,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1828942627, now seen corresponding path program 1 times [2024-11-07 00:01:27,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:27,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396074934] [2024-11-07 00:01:27,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:27,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,654 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:27,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:27,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396074934] [2024-11-07 00:01:27,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396074934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:27,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:27,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:01:27,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616228650] [2024-11-07 00:01:27,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:27,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:01:27,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:27,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:01:27,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:27,657 INFO L87 Difference]: Start difference. First operand 323 states and 451 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:27,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:27,705 INFO L93 Difference]: Finished difference Result 563 states and 804 transitions. [2024-11-07 00:01:27,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:27,706 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:27,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:27,709 INFO L225 Difference]: With dead ends: 563 [2024-11-07 00:01:27,709 INFO L226 Difference]: Without dead ends: 325 [2024-11-07 00:01:27,711 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:27,711 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1037 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,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1037 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,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-07 00:01:27,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2024-11-07 00:01:27,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 264 states have (on average 1.3333333333333333) internal successors, (352), 267 states have internal predecessors, (352), 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:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 448 transitions. [2024-11-07 00:01:27,733 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 448 transitions. Word has length 124 [2024-11-07 00:01:27,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:27,734 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 448 transitions. [2024-11-07 00:01:27,734 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:27,734 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 448 transitions. [2024-11-07 00:01:27,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 00:01:27,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:27,735 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:27,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:01:27,736 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:27,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:27,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1531403375, now seen corresponding path program 1 times [2024-11-07 00:01:27,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:27,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478676880] [2024-11-07 00:01:27,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:27,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,882 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:27,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:27,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478676880] [2024-11-07 00:01:27,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478676880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:27,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:27,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:27,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490714086] [2024-11-07 00:01:27,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:27,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:27,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:27,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:27,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:27,884 INFO L87 Difference]: Start difference. First operand 323 states and 448 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:27,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:27,952 INFO L93 Difference]: Finished difference Result 526 states and 764 transitions. [2024-11-07 00:01:27,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:27,953 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:27,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:27,956 INFO L225 Difference]: With dead ends: 526 [2024-11-07 00:01:27,956 INFO L226 Difference]: Without dead ends: 321 [2024-11-07 00:01:27,957 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:27,958 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 7 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 723 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:27,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 723 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:27,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-07 00:01:27,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2024-11-07 00:01:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 263 states have (on average 1.3307984790874525) internal successors, (350), 266 states have internal predecessors, (350), 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:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 444 transitions. [2024-11-07 00:01:27,974 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 444 transitions. Word has length 157 [2024-11-07 00:01:27,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:27,975 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 444 transitions. [2024-11-07 00:01:27,975 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:27,975 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 444 transitions. [2024-11-07 00:01:27,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-07 00:01:27,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:27,978 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:27,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:01:27,978 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:27,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:27,978 INFO L85 PathProgramCache]: Analyzing trace with hash -124413893, now seen corresponding path program 1 times [2024-11-07 00:01:27,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:27,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630573363] [2024-11-07 00:01:27,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:27,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,204 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:28,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:28,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630573363] [2024-11-07 00:01:28,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630573363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:28,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:28,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:28,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583584958] [2024-11-07 00:01:28,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:28,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:28,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:28,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:28,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:28,205 INFO L87 Difference]: Start difference. First operand 321 states and 444 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:28,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:28,276 INFO L93 Difference]: Finished difference Result 466 states and 660 transitions. [2024-11-07 00:01:28,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:28,277 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:28,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:28,279 INFO L225 Difference]: With dead ends: 466 [2024-11-07 00:01:28,279 INFO L226 Difference]: Without dead ends: 304 [2024-11-07 00:01:28,280 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:28,281 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 35 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 699 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:28,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 699 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:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-07 00:01:28,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2024-11-07 00:01:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 249 states have (on average 1.321285140562249) internal successors, (329), 252 states have internal predecessors, (329), 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:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 417 transitions. [2024-11-07 00:01:28,301 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 417 transitions. Word has length 172 [2024-11-07 00:01:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:28,301 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 417 transitions. [2024-11-07 00:01:28,301 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:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 417 transitions. [2024-11-07 00:01:28,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 00:01:28,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:28,304 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:28,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:01:28,304 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:28,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:28,305 INFO L85 PathProgramCache]: Analyzing trace with hash -225788768, now seen corresponding path program 1 times [2024-11-07 00:01:28,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:28,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169677288] [2024-11-07 00:01:28,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:28,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:28,448 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 25 [2024-11-07 00:01:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,515 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:28,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:28,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169677288] [2024-11-07 00:01:28,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169677288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:28,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:28,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:28,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314881959] [2024-11-07 00:01:28,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:28,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:28,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:28,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:28,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:28,520 INFO L87 Difference]: Start difference. First operand 304 states and 417 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:28,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:28,612 INFO L93 Difference]: Finished difference Result 449 states and 633 transitions. [2024-11-07 00:01:28,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:28,613 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:28,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:28,616 INFO L225 Difference]: With dead ends: 449 [2024-11-07 00:01:28,619 INFO L226 Difference]: Without dead ends: 285 [2024-11-07 00:01:28,621 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:28,621 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 30 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 703 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.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:28,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 703 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:01:28,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-07 00:01:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-07 00:01:28,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 233 states have (on average 1.3133047210300428) internal successors, (306), 236 states have internal predecessors, (306), 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:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 388 transitions. [2024-11-07 00:01:28,641 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 388 transitions. Word has length 174 [2024-11-07 00:01:28,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:28,641 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 388 transitions. [2024-11-07 00:01:28,641 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:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 388 transitions. [2024-11-07 00:01:28,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 00:01:28,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:28,646 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:28,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:01:28,647 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:28,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:28,647 INFO L85 PathProgramCache]: Analyzing trace with hash -771772203, now seen corresponding path program 1 times [2024-11-07 00:01:28,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:28,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974254011] [2024-11-07 00:01:28,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:28,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,858 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:28,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:28,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974254011] [2024-11-07 00:01:28,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974254011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:28,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:28,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:01:28,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580134007] [2024-11-07 00:01:28,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:28,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:01:28,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:28,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:01:28,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:28,859 INFO L87 Difference]: Start difference. First operand 285 states and 388 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:28,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:28,890 INFO L93 Difference]: Finished difference Result 429 states and 603 transitions. [2024-11-07 00:01:28,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:28,891 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:28,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:28,893 INFO L225 Difference]: With dead ends: 429 [2024-11-07 00:01:28,894 INFO L226 Difference]: Without dead ends: 285 [2024-11-07 00:01:28,894 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:28,895 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 0 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1015 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:28,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1015 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:28,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-07 00:01:28,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-07 00:01:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 233 states have (on average 1.2875536480686696) internal successors, (300), 236 states have internal predecessors, (300), 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:28,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 382 transitions. [2024-11-07 00:01:28,910 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 382 transitions. Word has length 175 [2024-11-07 00:01:28,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:28,911 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 382 transitions. [2024-11-07 00:01:28,911 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:28,911 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 382 transitions. [2024-11-07 00:01:28,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-07 00:01:28,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:28,913 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:28,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:01:28,914 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:28,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:28,914 INFO L85 PathProgramCache]: Analyzing trace with hash 171596258, now seen corresponding path program 1 times [2024-11-07 00:01:28,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:28,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463199331] [2024-11-07 00:01:28,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:28,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,105 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:29,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:29,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463199331] [2024-11-07 00:01:29,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463199331] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:29,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490011191] [2024-11-07 00:01:29,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:29,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:29,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:29,109 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:29,111 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:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 00:01:29,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:29,346 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:29,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:29,521 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:29,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490011191] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:29,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 00:01:29,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2024-11-07 00:01:29,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201902236] [2024-11-07 00:01:29,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:29,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:29,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:29,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:29,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:29,524 INFO L87 Difference]: Start difference. First operand 285 states and 382 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:29,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:29,589 INFO L93 Difference]: Finished difference Result 450 states and 625 transitions. [2024-11-07 00:01:29,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:29,590 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:29,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:29,592 INFO L225 Difference]: With dead ends: 450 [2024-11-07 00:01:29,592 INFO L226 Difference]: Without dead ends: 264 [2024-11-07 00:01:29,593 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:29,595 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 20 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 702 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:29,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 702 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:29,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-07 00:01:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-11-07 00:01:29,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 215 states have (on average 1.2790697674418605) internal successors, (275), 218 states have internal predecessors, (275), 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:29,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 351 transitions. [2024-11-07 00:01:29,613 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 351 transitions. Word has length 182 [2024-11-07 00:01:29,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:29,614 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 351 transitions. [2024-11-07 00:01:29,614 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:29,614 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 351 transitions. [2024-11-07 00:01:29,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 00:01:29,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:29,616 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:29,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 00:01:29,817 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:29,817 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:29,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:29,818 INFO L85 PathProgramCache]: Analyzing trace with hash 687203413, now seen corresponding path program 1 times [2024-11-07 00:01:29,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:29,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531532512] [2024-11-07 00:01:29,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:29,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,025 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:30,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:30,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531532512] [2024-11-07 00:01:30,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531532512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:30,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:30,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:30,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865551070] [2024-11-07 00:01:30,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:30,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:30,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:30,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:30,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:30,027 INFO L87 Difference]: Start difference. First operand 264 states and 351 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:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:30,067 INFO L93 Difference]: Finished difference Result 405 states and 564 transitions. [2024-11-07 00:01:30,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:30,068 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:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:30,070 INFO L225 Difference]: With dead ends: 405 [2024-11-07 00:01:30,070 INFO L226 Difference]: Without dead ends: 268 [2024-11-07 00:01:30,072 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:30,073 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 3 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 743 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:30,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 743 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:30,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-07 00:01:30,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-11-07 00:01:30,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 218 states have (on average 1.275229357798165) internal successors, (278), 221 states have internal predecessors, (278), 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:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 354 transitions. [2024-11-07 00:01:30,090 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 354 transitions. Word has length 206 [2024-11-07 00:01:30,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:30,091 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 354 transitions. [2024-11-07 00:01:30,091 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:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 354 transitions. [2024-11-07 00:01:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-07 00:01:30,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:30,093 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:30,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:01:30,094 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:30,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:30,094 INFO L85 PathProgramCache]: Analyzing trace with hash 209531083, now seen corresponding path program 1 times [2024-11-07 00:01:30,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:30,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270579159] [2024-11-07 00:01:30,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:30,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,333 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:30,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:30,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270579159] [2024-11-07 00:01:30,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270579159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:30,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017091425] [2024-11-07 00:01:30,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:30,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:30,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:30,336 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:30,340 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:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:30,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 00:01:30,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:30,554 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:30,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:30,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017091425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:30,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:30,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-07 00:01:30,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70200180] [2024-11-07 00:01:30,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:30,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:30,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:30,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:30,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:30,560 INFO L87 Difference]: Start difference. First operand 268 states and 354 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:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:30,605 INFO L93 Difference]: Finished difference Result 414 states and 572 transitions. [2024-11-07 00:01:30,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:30,606 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:30,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:30,608 INFO L225 Difference]: With dead ends: 414 [2024-11-07 00:01:30,609 INFO L226 Difference]: Without dead ends: 273 [2024-11-07 00:01:30,610 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:30,610 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 4 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 745 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:30,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 745 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:30,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-07 00:01:30,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-11-07 00:01:30,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 222 states have (on average 1.2702702702702702) internal successors, (282), 225 states have internal predecessors, (282), 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:30,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 358 transitions. [2024-11-07 00:01:30,626 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 358 transitions. Word has length 213 [2024-11-07 00:01:30,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:30,628 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 358 transitions. [2024-11-07 00:01:30,628 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:30,629 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 358 transitions. [2024-11-07 00:01:30,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-07 00:01:30,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:30,632 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:30,652 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:30,833 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:30,833 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:30,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:30,834 INFO L85 PathProgramCache]: Analyzing trace with hash 915774272, now seen corresponding path program 1 times [2024-11-07 00:01:30,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:30,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161314020] [2024-11-07 00:01:30,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:30,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 00:01:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,096 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:31,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:31,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161314020] [2024-11-07 00:01:31,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161314020] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:31,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852658706] [2024-11-07 00:01:31,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:31,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:31,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:31,099 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:31,102 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:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 00:01:31,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:31,339 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:31,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:31,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852658706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:31,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:31,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-07 00:01:31,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899598946] [2024-11-07 00:01:31,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:31,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:31,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:31,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:31,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:31,343 INFO L87 Difference]: Start difference. First operand 273 states and 358 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:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:31,384 INFO L93 Difference]: Finished difference Result 418 states and 572 transitions. [2024-11-07 00:01:31,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:31,385 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:31,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:31,387 INFO L225 Difference]: With dead ends: 418 [2024-11-07 00:01:31,388 INFO L226 Difference]: Without dead ends: 272 [2024-11-07 00:01:31,388 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:31,390 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 5 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 735 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:31,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 735 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:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-07 00:01:31,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2024-11-07 00:01:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 222 states have (on average 1.2567567567567568) internal successors, (279), 224 states have internal predecessors, (279), 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:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 353 transitions. [2024-11-07 00:01:31,412 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 353 transitions. Word has length 221 [2024-11-07 00:01:31,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:31,412 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 353 transitions. [2024-11-07 00:01:31,412 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:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 353 transitions. [2024-11-07 00:01:31,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-07 00:01:31,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:31,417 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] [2024-11-07 00:01:31,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 00:01:31,617 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:31,617 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:31,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:31,618 INFO L85 PathProgramCache]: Analyzing trace with hash 568293619, now seen corresponding path program 1 times [2024-11-07 00:01:31,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:31,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325564637] [2024-11-07 00:01:31,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:31,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 00:01:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 00:01:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,835 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:31,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:31,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325564637] [2024-11-07 00:01:31,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325564637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:31,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:31,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:31,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097572710] [2024-11-07 00:01:31,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:31,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:31,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:31,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:31,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:31,837 INFO L87 Difference]: Start difference. First operand 272 states and 353 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 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:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:32,095 INFO L93 Difference]: Finished difference Result 416 states and 561 transitions. [2024-11-07 00:01:32,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:32,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 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 228 [2024-11-07 00:01:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:32,098 INFO L225 Difference]: With dead ends: 416 [2024-11-07 00:01:32,098 INFO L226 Difference]: Without dead ends: 271 [2024-11-07 00:01:32,099 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:32,100 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 59 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 476 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.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:32,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 476 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:01:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-07 00:01:32,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2024-11-07 00:01:32,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 222 states have (on average 1.2522522522522523) internal successors, (278), 223 states have internal predecessors, (278), 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:32,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 350 transitions. [2024-11-07 00:01:32,124 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 350 transitions. Word has length 228 [2024-11-07 00:01:32,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:32,124 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 350 transitions. [2024-11-07 00:01:32,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 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:32,124 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 350 transitions. [2024-11-07 00:01:32,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-07 00:01:32,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:32,127 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, 1] [2024-11-07 00:01:32,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 00:01:32,127 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:32,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:32,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1358671604, now seen corresponding path program 1 times [2024-11-07 00:01:32,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:32,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125270558] [2024-11-07 00:01:32,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:32,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 00:01:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 00:01:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,472 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:32,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:32,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125270558] [2024-11-07 00:01:32,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125270558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:32,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:32,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:01:32,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725583918] [2024-11-07 00:01:32,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:32,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:01:32,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:32,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:01:32,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:32,474 INFO L87 Difference]: Start difference. First operand 271 states and 350 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 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:33,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:33,000 INFO L93 Difference]: Finished difference Result 621 states and 830 transitions. [2024-11-07 00:01:33,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:01:33,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 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 231 [2024-11-07 00:01:33,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:33,007 INFO L225 Difference]: With dead ends: 621 [2024-11-07 00:01:33,008 INFO L226 Difference]: Without dead ends: 477 [2024-11-07 00:01:33,008 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:33,010 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 407 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 625 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:33,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 625 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:33,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-07 00:01:33,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 423. [2024-11-07 00:01:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 344 states have (on average 1.2994186046511629) internal successors, (447), 346 states have internal predecessors, (447), 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:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 555 transitions. [2024-11-07 00:01:33,063 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 555 transitions. Word has length 231 [2024-11-07 00:01:33,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:33,064 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 555 transitions. [2024-11-07 00:01:33,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 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:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 555 transitions. [2024-11-07 00:01:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-07 00:01:33,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:33,067 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] [2024-11-07 00:01:33,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 00:01:33,068 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:33,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:33,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1534595272, now seen corresponding path program 1 times [2024-11-07 00:01:33,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:33,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188331026] [2024-11-07 00:01:33,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:33,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 00:01:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 00:01:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-11-07 00:01:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-07 00:01:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-07 00:01:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,292 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:33,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:33,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188331026] [2024-11-07 00:01:33,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188331026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:33,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:33,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:33,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860615366] [2024-11-07 00:01:33,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:33,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:33,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:33,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:33,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:33,294 INFO L87 Difference]: Start difference. First operand 423 states and 555 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 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:33,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:33,725 INFO L93 Difference]: Finished difference Result 893 states and 1225 transitions. [2024-11-07 00:01:33,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:33,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 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 258 [2024-11-07 00:01:33,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:33,730 INFO L225 Difference]: With dead ends: 893 [2024-11-07 00:01:33,731 INFO L226 Difference]: Without dead ends: 665 [2024-11-07 00:01:33,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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:33,732 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 219 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 472 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:33,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 472 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:33,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-07 00:01:33,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 503. [2024-11-07 00:01:33,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 414 states have (on average 1.3091787439613527) internal successors, (542), 417 states have internal predecessors, (542), 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:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 660 transitions. [2024-11-07 00:01:33,790 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 660 transitions. Word has length 258 [2024-11-07 00:01:33,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:33,792 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 660 transitions. [2024-11-07 00:01:33,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 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:33,792 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 660 transitions. [2024-11-07 00:01:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-07 00:01:33,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:33,795 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:33,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 00:01:33,795 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:33,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:33,795 INFO L85 PathProgramCache]: Analyzing trace with hash -141182582, now seen corresponding path program 1 times [2024-11-07 00:01:33,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:33,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679382645] [2024-11-07 00:01:33,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:33,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 00:01:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 00:01:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:33,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-07 00:01:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-07 00:01:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-07 00:01:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,004 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:34,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:34,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679382645] [2024-11-07 00:01:34,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679382645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:34,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:34,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:34,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890152130] [2024-11-07 00:01:34,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:34,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:34,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:34,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:34,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:34,006 INFO L87 Difference]: Start difference. First operand 503 states and 660 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:34,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:34,463 INFO L93 Difference]: Finished difference Result 1067 states and 1456 transitions. [2024-11-07 00:01:34,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:34,464 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:34,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:34,472 INFO L225 Difference]: With dead ends: 1067 [2024-11-07 00:01:34,472 INFO L226 Difference]: Without dead ends: 788 [2024-11-07 00:01:34,473 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:34,474 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 220 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 500 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.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:34,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 500 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:01:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-11-07 00:01:34,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 613. [2024-11-07 00:01:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 512 states have (on average 1.3203125) internal successors, (676), 517 states have internal predecessors, (676), 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:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 806 transitions. [2024-11-07 00:01:34,527 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 806 transitions. Word has length 259 [2024-11-07 00:01:34,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:34,528 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 806 transitions. [2024-11-07 00:01:34,528 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:34,528 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 806 transitions. [2024-11-07 00:01:34,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-07 00:01:34,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:34,532 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:34,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 00:01:34,532 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:34,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:34,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1355646765, now seen corresponding path program 1 times [2024-11-07 00:01:34,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:34,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982616566] [2024-11-07 00:01:34,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:34,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 00:01:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 00:01:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-07 00:01:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-07 00:01:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-07 00:01:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:34,752 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:34,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:34,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982616566] [2024-11-07 00:01:34,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982616566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:34,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:34,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:34,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691391051] [2024-11-07 00:01:34,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:34,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:34,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:34,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:34,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:34,755 INFO L87 Difference]: Start difference. First operand 613 states and 806 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 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:35,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:35,237 INFO L93 Difference]: Finished difference Result 1283 states and 1750 transitions. [2024-11-07 00:01:35,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:35,238 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), 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 260 [2024-11-07 00:01:35,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:35,245 INFO L225 Difference]: With dead ends: 1283 [2024-11-07 00:01:35,245 INFO L226 Difference]: Without dead ends: 926 [2024-11-07 00:01:35,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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:35,247 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 220 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 527 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:35,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 527 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:35,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-07 00:01:35,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 723. [2024-11-07 00:01:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 614 states have (on average 1.3355048859934853) internal successors, (820), 623 states have internal predecessors, (820), 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:35,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 958 transitions. [2024-11-07 00:01:35,315 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 958 transitions. Word has length 260 [2024-11-07 00:01:35,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:35,316 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 958 transitions. [2024-11-07 00:01:35,316 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), 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:35,316 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 958 transitions. [2024-11-07 00:01:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-07 00:01:35,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:35,319 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,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 00:01:35,320 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:35,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:35,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1080887151, now seen corresponding path program 1 times [2024-11-07 00:01:35,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:35,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433648081] [2024-11-07 00:01:35,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:35,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 00:01:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 00:01:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-07 00:01:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-07 00:01:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-07 00:01:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,685 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:35,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:35,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433648081] [2024-11-07 00:01:35,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433648081] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:35,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810731143] [2024-11-07 00:01:35,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:35,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:35,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:35,689 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:35,691 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:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 00:01:35,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:36,003 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:36,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:36,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810731143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:36,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:36,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-07 00:01:36,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56808882] [2024-11-07 00:01:36,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:36,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:36,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:36,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:36,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 00:01:36,007 INFO L87 Difference]: Start difference. First operand 723 states and 958 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:36,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:36,137 INFO L93 Difference]: Finished difference Result 1194 states and 1622 transitions. [2024-11-07 00:01:36,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:36,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 260 [2024-11-07 00:01:36,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:36,144 INFO L225 Difference]: With dead ends: 1194 [2024-11-07 00:01:36,144 INFO L226 Difference]: Without dead ends: 723 [2024-11-07 00:01:36,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 303 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:36,147 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 31 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 670 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:36,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 670 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:36,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-11-07 00:01:36,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2024-11-07 00:01:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 614 states have (on average 1.3257328990228012) internal successors, (814), 623 states have internal predecessors, (814), 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:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 952 transitions. [2024-11-07 00:01:36,211 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 952 transitions. Word has length 260 [2024-11-07 00:01:36,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:36,211 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 952 transitions. [2024-11-07 00:01:36,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 952 transitions. [2024-11-07 00:01:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-07 00:01:36,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:36,215 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] [2024-11-07 00:01:36,236 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:36,416 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:36,416 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:36,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:36,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1702413312, now seen corresponding path program 1 times [2024-11-07 00:01:36,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:36,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902967083] [2024-11-07 00:01:36,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:36,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:36,673 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 20 [2024-11-07 00:01:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:36,677 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 143 [2024-11-07 00:01:36,680 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 6 [2024-11-07 00:01:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 00:01:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 00:01:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-07 00:01:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-07 00:01:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-07 00:01:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,743 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:36,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:36,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902967083] [2024-11-07 00:01:36,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902967083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:36,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655709986] [2024-11-07 00:01:36,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:36,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:36,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:36,747 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:36,748 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:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 00:01:36,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:37,024 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:37,024 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:37,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655709986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:37,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:37,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-07 00:01:37,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532739028] [2024-11-07 00:01:37,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:37,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:37,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:37,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:37,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 00:01:37,026 INFO L87 Difference]: Start difference. First operand 723 states and 952 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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:37,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:37,134 INFO L93 Difference]: Finished difference Result 1194 states and 1608 transitions. [2024-11-07 00:01:37,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:37,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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:37,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:37,145 INFO L225 Difference]: With dead ends: 1194 [2024-11-07 00:01:37,145 INFO L226 Difference]: Without dead ends: 735 [2024-11-07 00:01:37,149 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:37,150 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 7 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 678 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:37,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 678 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:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-11-07 00:01:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2024-11-07 00:01:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 624 states have (on average 1.3269230769230769) internal successors, (828), 633 states have internal predecessors, (828), 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:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 966 transitions. [2024-11-07 00:01:37,229 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 966 transitions. Word has length 261 [2024-11-07 00:01:37,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:37,230 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 966 transitions. [2024-11-07 00:01:37,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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:37,230 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 966 transitions. [2024-11-07 00:01:37,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-07 00:01:37,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:37,234 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] [2024-11-07 00:01:37,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 00:01:37,435 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:37,435 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:37,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:37,435 INFO L85 PathProgramCache]: Analyzing trace with hash -955415893, now seen corresponding path program 1 times [2024-11-07 00:01:37,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:37,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529261181] [2024-11-07 00:01:37,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:37,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [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 14 [2024-11-07 00:01:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:37,688 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 4 [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 17 [2024-11-07 00:01:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:37,697 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 90 [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 5 [2024-11-07 00:01:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,708 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 35 [2024-11-07 00:01:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 00:01:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 00:01:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-07 00:01:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-07 00:01:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-07 00:01:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,775 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:37,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:37,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529261181] [2024-11-07 00:01:37,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529261181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:37,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:37,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:37,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927386266] [2024-11-07 00:01:37,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:37,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:37,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:37,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:37,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:37,777 INFO L87 Difference]: Start difference. First operand 735 states and 966 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 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:38,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:38,073 INFO L93 Difference]: Finished difference Result 1208 states and 1622 transitions. [2024-11-07 00:01:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:38,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 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 262 [2024-11-07 00:01:38,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:38,080 INFO L225 Difference]: With dead ends: 1208 [2024-11-07 00:01:38,080 INFO L226 Difference]: Without dead ends: 715 [2024-11-07 00:01:38,082 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:38,082 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 59 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 474 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.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:38,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 474 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:01:38,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-07 00:01:38,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-11-07 00:01:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 605 states have (on average 1.3107438016528925) internal successors, (793), 613 states have internal predecessors, (793), 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:38,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 930 transitions. [2024-11-07 00:01:38,136 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 930 transitions. Word has length 262 [2024-11-07 00:01:38,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:38,137 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 930 transitions. [2024-11-07 00:01:38,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 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:38,137 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 930 transitions. [2024-11-07 00:01:38,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-07 00:01:38,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:38,140 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:38,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 00:01:38,140 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:38,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:38,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1386884296, now seen corresponding path program 1 times [2024-11-07 00:01:38,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:38,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859964992] [2024-11-07 00:01:38,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:38,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:01:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:01:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 00:01:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-07 00:01:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-07 00:01:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:38,629 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:38,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:38,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859964992] [2024-11-07 00:01:38,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859964992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:38,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:38,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:01:38,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330715876] [2024-11-07 00:01:38,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:38,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:01:38,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:38,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:01:38,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:01:38,631 INFO L87 Difference]: Start difference. First operand 715 states and 930 transitions. Second operand has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 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:39,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:39,205 INFO L93 Difference]: Finished difference Result 1036 states and 1422 transitions. [2024-11-07 00:01:39,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:01:39,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 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 263 [2024-11-07 00:01:39,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:39,217 INFO L225 Difference]: With dead ends: 1036 [2024-11-07 00:01:39,218 INFO L226 Difference]: Without dead ends: 1034 [2024-11-07 00:01:39,219 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:39,219 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 182 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1530 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:39,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1530 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:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-07 00:01:39,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 721. [2024-11-07 00:01:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 609 states have (on average 1.3087027914614122) internal successors, (797), 618 states have internal predecessors, (797), 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:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 936 transitions. [2024-11-07 00:01:39,281 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 936 transitions. Word has length 263 [2024-11-07 00:01:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:39,282 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 936 transitions. [2024-11-07 00:01:39,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 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:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 936 transitions. [2024-11-07 00:01:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-07 00:01:39,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:39,286 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] [2024-11-07 00:01:39,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 00:01:39,286 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:39,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:39,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1763607020, now seen corresponding path program 1 times [2024-11-07 00:01:39,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:39,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016644811] [2024-11-07 00:01:39,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:39,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:01:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:01:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 00:01:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-07 00:01:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-07 00:01:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-07 00:01:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:39,769 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:39,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:39,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016644811] [2024-11-07 00:01:39,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016644811] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:39,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528824537] [2024-11-07 00:01:39,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:39,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:39,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:39,772 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:39,774 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:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:40,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 00:01:40,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:40,223 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:40,224 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:40,639 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:40,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528824537] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:40,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:40,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2024-11-07 00:01:40,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313096712] [2024-11-07 00:01:40,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:40,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 00:01:40,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:40,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 00:01:40,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:01:40,643 INFO L87 Difference]: Start difference. First operand 721 states and 936 transitions. Second operand has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 14 states have internal predecessors, (145), 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:42,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:42,425 INFO L93 Difference]: Finished difference Result 1726 states and 2317 transitions. [2024-11-07 00:01:42,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 00:01:42,425 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 14 states have internal predecessors, (145), 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 271 [2024-11-07 00:01:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:42,450 INFO L225 Difference]: With dead ends: 1726 [2024-11-07 00:01:42,450 INFO L226 Difference]: Without dead ends: 1267 [2024-11-07 00:01:42,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 583 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 00:01:42,454 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 348 mSDsluCounter, 2389 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 2623 SdHoareTripleChecker+Invalid, 1953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:42,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 2623 Invalid, 1953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1892 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 00:01:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2024-11-07 00:01:42,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 989. [2024-11-07 00:01:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 837 states have (on average 1.2915173237753883) internal successors, (1081), 847 states have internal predecessors, (1081), 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:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1273 transitions. [2024-11-07 00:01:42,544 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1273 transitions. Word has length 271 [2024-11-07 00:01:42,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:42,544 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1273 transitions. [2024-11-07 00:01:42,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 14 states have internal predecessors, (145), 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:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1273 transitions. [2024-11-07 00:01:42,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-07 00:01:42,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:42,549 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] [2024-11-07 00:01:42,571 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:42,750 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:42,750 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:42,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:42,751 INFO L85 PathProgramCache]: Analyzing trace with hash -801993003, now seen corresponding path program 1 times [2024-11-07 00:01:42,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:42,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067388235] [2024-11-07 00:01:42,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:42,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:01:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:01:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 00:01:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-07 00:01:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-07 00:01:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-07 00:01:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,960 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:42,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:42,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067388235] [2024-11-07 00:01:42,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067388235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:42,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003053126] [2024-11-07 00:01:42,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:42,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:42,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:42,964 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:42,966 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:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 00:01:43,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:43,212 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:43,213 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:43,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003053126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:43,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:43,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-07 00:01:43,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99125965] [2024-11-07 00:01:43,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:43,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:43,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:43,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:43,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:43,215 INFO L87 Difference]: Start difference. First operand 989 states and 1273 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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:43,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:43,341 INFO L93 Difference]: Finished difference Result 1841 states and 2410 transitions. [2024-11-07 00:01:43,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:43,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 271 [2024-11-07 00:01:43,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:43,347 INFO L225 Difference]: With dead ends: 1841 [2024-11-07 00:01:43,347 INFO L226 Difference]: Without dead ends: 973 [2024-11-07 00:01:43,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 317 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:43,350 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 4 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 675 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:43,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 675 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:43,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2024-11-07 00:01:43,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2024-11-07 00:01:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 826 states have (on average 1.2796610169491525) internal successors, (1057), 836 states have internal predecessors, (1057), 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:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1240 transitions. [2024-11-07 00:01:43,415 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1240 transitions. Word has length 271 [2024-11-07 00:01:43,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:43,416 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1240 transitions. [2024-11-07 00:01:43,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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:43,416 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1240 transitions. [2024-11-07 00:01:43,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-11-07 00:01:43,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:43,419 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] [2024-11-07 00:01:43,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-07 00:01:43,623 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:43,628 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:43,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:43,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1829250860, now seen corresponding path program 1 times [2024-11-07 00:01:43,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:43,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073678074] [2024-11-07 00:01:43,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:43,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:01:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:01:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 00:01:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-07 00:01:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-07 00:01:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-07 00:01:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-07 00:01:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-07 00:01:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-07 00:01:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:43,848 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:43,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:43,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073678074] [2024-11-07 00:01:43,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073678074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:43,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149950371] [2024-11-07 00:01:43,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:43,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:43,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:43,851 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:43,853 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:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 00:01:44,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:44,115 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:44,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:44,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149950371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:44,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:44,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-07 00:01:44,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582823658] [2024-11-07 00:01:44,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:44,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:44,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:44,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:44,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:44,118 INFO L87 Difference]: Start difference. First operand 973 states and 1240 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:44,237 INFO L93 Difference]: Finished difference Result 1689 states and 2194 transitions. [2024-11-07 00:01:44,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:44,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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 274 [2024-11-07 00:01:44,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:44,243 INFO L225 Difference]: With dead ends: 1689 [2024-11-07 00:01:44,244 INFO L226 Difference]: Without dead ends: 828 [2024-11-07 00:01:44,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 320 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:44,246 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 4 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 703 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:44,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 703 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:44,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2024-11-07 00:01:44,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828. [2024-11-07 00:01:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 699 states have (on average 1.2789699570815452) internal successors, (894), 709 states have internal predecessors, (894), 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:44,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1055 transitions. [2024-11-07 00:01:44,305 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1055 transitions. Word has length 274 [2024-11-07 00:01:44,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:44,306 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1055 transitions. [2024-11-07 00:01:44,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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:44,306 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1055 transitions. [2024-11-07 00:01:44,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-07 00:01:44,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:44,308 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] [2024-11-07 00:01:44,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-07 00:01:44,509 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:44,510 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:44,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:44,511 INFO L85 PathProgramCache]: Analyzing trace with hash 211214063, now seen corresponding path program 1 times [2024-11-07 00:01:44,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:44,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905095107] [2024-11-07 00:01:44,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:44,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:01:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:01:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 00:01:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-07 00:01:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-07 00:01:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-07 00:01:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-07 00:01:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-07 00:01:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,985 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:44,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:44,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905095107] [2024-11-07 00:01:44,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905095107] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:44,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828391145] [2024-11-07 00:01:44,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:44,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:44,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:44,990 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:44,992 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:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 00:01:45,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:45,408 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:45,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:45,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828391145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:45,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:45,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-11-07 00:01:45,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300671774] [2024-11-07 00:01:45,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:45,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:01:45,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:45,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:01:45,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:01:45,411 INFO L87 Difference]: Start difference. First operand 828 states and 1055 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 7 states have internal predecessors, (105), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-07 00:01:45,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:45,777 INFO L93 Difference]: Finished difference Result 1578 states and 2038 transitions. [2024-11-07 00:01:45,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:01:45,778 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 7 states have internal predecessors, (105), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 286 [2024-11-07 00:01:45,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:45,785 INFO L225 Difference]: With dead ends: 1578 [2024-11-07 00:01:45,785 INFO L226 Difference]: Without dead ends: 1112 [2024-11-07 00:01:45,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:01:45,787 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 127 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:45,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1846 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:01:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2024-11-07 00:01:45,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 990. [2024-11-07 00:01:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 833 states have (on average 1.2725090036014406) internal successors, (1060), 844 states have internal predecessors, (1060), 99 states have call successors, (99), 58 states have call predecessors, (99), 57 states have return successors, (98), 94 states have call predecessors, (98), 98 states have call successors, (98) [2024-11-07 00:01:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1257 transitions. [2024-11-07 00:01:45,883 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1257 transitions. Word has length 286 [2024-11-07 00:01:45,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:45,884 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1257 transitions. [2024-11-07 00:01:45,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 7 states have internal predecessors, (105), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-07 00:01:45,884 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1257 transitions. [2024-11-07 00:01:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-07 00:01:45,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:45,886 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] [2024-11-07 00:01:45,908 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:46,086 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:46,087 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:46,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:46,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1543527212, now seen corresponding path program 1 times [2024-11-07 00:01:46,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:46,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995374169] [2024-11-07 00:01:46,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:46,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:46,402 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 207 [2024-11-07 00:01:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:01:46,410 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 231 [2024-11-07 00:01:46,415 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 240 [2024-11-07 00:01:46,417 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 250 [2024-11-07 00:01:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-07 00:01:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-07 00:01:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-07 00:01:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:46,428 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:46,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:46,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995374169] [2024-11-07 00:01:46,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995374169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:46,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:46,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:01:46,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430550737] [2024-11-07 00:01:46,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:46,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:01:46,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:46,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:01:46,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:01:46,431 INFO L87 Difference]: Start difference. First operand 990 states and 1257 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 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:46,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:46,806 INFO L93 Difference]: Finished difference Result 1714 states and 2250 transitions. [2024-11-07 00:01:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:01:46,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 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 292 [2024-11-07 00:01:46,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:46,816 INFO L225 Difference]: With dead ends: 1714 [2024-11-07 00:01:46,817 INFO L226 Difference]: Without dead ends: 1071 [2024-11-07 00:01:46,819 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:46,819 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 90 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:46,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 703 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:01:46,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-11-07 00:01:46,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1045. [2024-11-07 00:01:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 876 states have (on average 1.2831050228310503) internal successors, (1124), 887 states have internal predecessors, (1124), 111 states have call successors, (111), 58 states have call predecessors, (111), 57 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-07 00:01:46,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1345 transitions. [2024-11-07 00:01:46,900 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1345 transitions. Word has length 292 [2024-11-07 00:01:46,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:46,901 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1345 transitions. [2024-11-07 00:01:46,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 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:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1345 transitions. [2024-11-07 00:01:46,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-07 00:01:46,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:46,904 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] [2024-11-07 00:01:46,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-07 00:01:46,904 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:46,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:46,905 INFO L85 PathProgramCache]: Analyzing trace with hash -286887768, now seen corresponding path program 1 times [2024-11-07 00:01:46,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:46,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950602629] [2024-11-07 00:01:46,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:46,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:01:47,499 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 215 [2024-11-07 00:01:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 00:01:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-07 00:01:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-07 00:01:47,515 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 261 [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 269 [2024-11-07 00:01:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-07 00:01:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,535 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:47,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:47,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950602629] [2024-11-07 00:01:47,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950602629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:47,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193998328] [2024-11-07 00:01:47,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:47,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:47,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:47,538 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:47,539 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:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:47,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 00:01:47,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:47,985 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:47,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:47,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193998328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:47,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:47,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 17 [2024-11-07 00:01:47,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317464416] [2024-11-07 00:01:47,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:47,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 00:01:47,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:47,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 00:01:47,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:01:47,988 INFO L87 Difference]: Start difference. First operand 1045 states and 1345 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 9 states have internal predecessors, (113), 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,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:48,627 INFO L93 Difference]: Finished difference Result 2345 states and 3036 transitions. [2024-11-07 00:01:48,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 00:01:48,628 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 9 states have internal predecessors, (113), 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 292 [2024-11-07 00:01:48,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:48,637 INFO L225 Difference]: With dead ends: 2345 [2024-11-07 00:01:48,637 INFO L226 Difference]: Without dead ends: 1648 [2024-11-07 00:01:48,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2024-11-07 00:01:48,640 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 595 mSDsluCounter, 1989 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:48,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 2299 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:01:48,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2024-11-07 00:01:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1221. [2024-11-07 00:01:48,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1020 states have (on average 1.2754901960784313) internal successors, (1301), 1033 states have internal predecessors, (1301), 133 states have call successors, (133), 68 states have call predecessors, (133), 67 states have return successors, (132), 126 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-07 00:01:48,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1566 transitions. [2024-11-07 00:01:48,736 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1566 transitions. Word has length 292 [2024-11-07 00:01:48,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:48,737 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1566 transitions. [2024-11-07 00:01:48,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 9 states have internal predecessors, (113), 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,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1566 transitions. [2024-11-07 00:01:48,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-07 00:01:48,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:48,739 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] [2024-11-07 00:01:48,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-07 00:01:48,940 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:48,940 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:48,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:48,941 INFO L85 PathProgramCache]: Analyzing trace with hash 600167080, now seen corresponding path program 1 times [2024-11-07 00:01:48,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:48,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031790880] [2024-11-07 00:01:48,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:48,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:01:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:01:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 00:01:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-07 00:01:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-07 00:01:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-07 00:01:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-07 00:01:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-07 00:01:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,320 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:49,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:49,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031790880] [2024-11-07 00:01:49,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031790880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:49,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713382137] [2024-11-07 00:01:49,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:49,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:49,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:49,323 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:49,325 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:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 00:01:49,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:49,648 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:49,648 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:49,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713382137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:49,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:49,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 10 [2024-11-07 00:01:49,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194341246] [2024-11-07 00:01:49,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:49,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:01:49,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:49,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:01:49,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 00:01:49,650 INFO L87 Difference]: Start difference. First operand 1221 states and 1566 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-07 00:01:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:49,951 INFO L93 Difference]: Finished difference Result 2194 states and 2841 transitions. [2024-11-07 00:01:49,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:01:49,952 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 292 [2024-11-07 00:01:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:49,960 INFO L225 Difference]: With dead ends: 2194 [2024-11-07 00:01:49,960 INFO L226 Difference]: Without dead ends: 1318 [2024-11-07 00:01:49,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:01:49,963 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 120 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:49,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1707 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:01:49,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2024-11-07 00:01:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1199. [2024-11-07 00:01:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 1004 states have (on average 1.2709163346613546) internal successors, (1276), 1017 states have internal predecessors, (1276), 127 states have call successors, (127), 68 states have call predecessors, (127), 67 states have return successors, (126), 120 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-07 00:01:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1529 transitions. [2024-11-07 00:01:50,101 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1529 transitions. Word has length 292 [2024-11-07 00:01:50,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:50,102 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 1529 transitions. [2024-11-07 00:01:50,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-07 00:01:50,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1529 transitions. [2024-11-07 00:01:50,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-11-07 00:01:50,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:50,106 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:50,127 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:50,306 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:50,307 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:50,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:50,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1957012249, now seen corresponding path program 1 times [2024-11-07 00:01:50,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:50,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458826007] [2024-11-07 00:01:50,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:50,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:50,471 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 3 [2024-11-07 00:01:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:01:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:01:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 00:01:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-07 00:01:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-07 00:01:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-07 00:01:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-07 00:01:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-07 00:01:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-07 00:01:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:50,542 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:50,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:50,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458826007] [2024-11-07 00:01:50,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458826007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:50,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:50,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:01:50,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292592139] [2024-11-07 00:01:50,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:50,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:01:50,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:50,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:01:50,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:50,545 INFO L87 Difference]: Start difference. First operand 1199 states and 1529 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:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:51,184 INFO L93 Difference]: Finished difference Result 1977 states and 2543 transitions. [2024-11-07 00:01:51,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:01:51,185 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:51,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:51,191 INFO L225 Difference]: With dead ends: 1977 [2024-11-07 00:01:51,191 INFO L226 Difference]: Without dead ends: 1135 [2024-11-07 00:01:51,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 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:51,194 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 480 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:51,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 762 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:01:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2024-11-07 00:01:51,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 898. [2024-11-07 00:01:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 767 states have (on average 1.2464146023468057) internal successors, (956), 770 states have internal predecessors, (956), 85 states have call successors, (85), 45 states have call predecessors, (85), 45 states have return successors, (85), 82 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-07 00:01:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1126 transitions. [2024-11-07 00:01:51,263 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1126 transitions. Word has length 300 [2024-11-07 00:01:51,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:51,265 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1126 transitions. [2024-11-07 00:01:51,265 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:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1126 transitions. [2024-11-07 00:01:51,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-07 00:01:51,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:51,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-07 00:01:51,269 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:51,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash 336941807, now seen corresponding path program 1 times [2024-11-07 00:01:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:51,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89319417] [2024-11-07 00:01:51,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:51,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:01:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:01:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:01:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:01:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:01:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:01:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:01:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:01:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:01:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:01:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:01:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:01:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:01:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 00:01:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-07 00:01:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-07 00:01:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-07 00:01:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-07 00:01:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-07 00:01:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-11-07 00:01:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-11-07 00:01:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-07 00:01:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2024-11-07 00:01:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-11-07 00:01:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,285 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2024-11-07 00:01:52,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:52,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89319417] [2024-11-07 00:01:52,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89319417] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:52,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172465788] [2024-11-07 00:01:52,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:52,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:52,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:52,289 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:01:52,291 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:01:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:52,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-07 00:01:52,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:53,473 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 195 proven. 102 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-07 00:01:53,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 14 proven. 28 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2024-11-07 00:01:54,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172465788] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:54,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:54,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 18] total 35 [2024-11-07 00:01:54,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351983961] [2024-11-07 00:01:54,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:54,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-07 00:01:54,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:54,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-07 00:01:54,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 00:01:54,200 INFO L87 Difference]: Start difference. First operand 898 states and 1126 transitions. Second operand has 35 states, 34 states have (on average 8.058823529411764) internal successors, (274), 31 states have internal predecessors, (274), 14 states have call successors, (56), 9 states have call predecessors, (56), 10 states have return successors, (50), 15 states have call predecessors, (50), 13 states have call successors, (50) [2024-11-07 00:02:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:16,080 INFO L93 Difference]: Finished difference Result 13757 states and 18805 transitions. [2024-11-07 00:02:16,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 515 states. [2024-11-07 00:02:16,080 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 8.058823529411764) internal successors, (274), 31 states have internal predecessors, (274), 14 states have call successors, (56), 9 states have call predecessors, (56), 10 states have return successors, (50), 15 states have call predecessors, (50), 13 states have call successors, (50) Word has length 340 [2024-11-07 00:02:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:16,194 INFO L225 Difference]: With dead ends: 13757 [2024-11-07 00:02:16,195 INFO L226 Difference]: Without dead ends: 13224 [2024-11-07 00:02:16,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1341 GetRequests, 798 SyntacticMatches, 1 SemanticMatches, 542 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134605 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=15614, Invalid=279778, Unknown=0, NotChecked=0, Total=295392 [2024-11-07 00:02:16,242 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 11189 mSDsluCounter, 14157 mSDsCounter, 0 mSdLazyCounter, 13512 mSolverCounterSat, 2636 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11221 SdHoareTripleChecker+Valid, 14941 SdHoareTripleChecker+Invalid, 16148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2636 IncrementalHoareTripleChecker+Valid, 13512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:02:16,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11221 Valid, 14941 Invalid, 16148 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2636 Valid, 13512 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-11-07 00:02:16,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13224 states. [2024-11-07 00:02:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13224 to 2283. [2024-11-07 00:02:16,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2283 states, 1943 states have (on average 1.2660833762223367) internal successors, (2460), 1955 states have internal predecessors, (2460), 226 states have call successors, (226), 113 states have call predecessors, (226), 113 states have return successors, (226), 214 states have call predecessors, (226), 226 states have call successors, (226) [2024-11-07 00:02:16,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 2912 transitions. [2024-11-07 00:02:16,761 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 2912 transitions. Word has length 340 [2024-11-07 00:02:16,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:16,762 INFO L471 AbstractCegarLoop]: Abstraction has 2283 states and 2912 transitions. [2024-11-07 00:02:16,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 8.058823529411764) internal successors, (274), 31 states have internal predecessors, (274), 14 states have call successors, (56), 9 states have call predecessors, (56), 10 states have return successors, (50), 15 states have call predecessors, (50), 13 states have call successors, (50) [2024-11-07 00:02:16,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 2912 transitions. [2024-11-07 00:02:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-07 00:02:16,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:16,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:16,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-07 00:02:16,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:02:16,970 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:16,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:16,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1208992398, now seen corresponding path program 1 times [2024-11-07 00:02:16,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:16,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783348182] [2024-11-07 00:02:16,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:16,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:02:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:02:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:02:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:02:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:02:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:02:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:02:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:02:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:02:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:02:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:02:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 00:02:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 00:02:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 00:02:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:02:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:02:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 00:02:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 00:02:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 00:02:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-07 00:02:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-07 00:02:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-07 00:02:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-07 00:02:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-07 00:02:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:17,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-07 00:02:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:18,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-07 00:02:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:18,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2024-11-07 00:02:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:18,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2024-11-07 00:02:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:18,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2024-11-07 00:02:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:18,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2024-11-07 00:02:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2024-11-07 00:02:18,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:18,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783348182] [2024-11-07 00:02:18,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783348182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:02:18,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829156806] [2024-11-07 00:02:18,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:18,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:02:18,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:02:18,038 INFO L229 MonitoredProcess]: Starting monitored process 15 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:18,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-07 00:02:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:18,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-07 00:02:18,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:02:19,089 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 195 proven. 100 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2024-11-07 00:02:19,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:02:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2024-11-07 00:02:19,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829156806] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:02:19,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:02:19,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 18] total 39 [2024-11-07 00:02:19,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735458677] [2024-11-07 00:02:19,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:02:19,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-07 00:02:19,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:19,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-07 00:02:19,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1332, Unknown=0, NotChecked=0, Total=1482 [2024-11-07 00:02:19,710 INFO L87 Difference]: Start difference. First operand 2283 states and 2912 transitions. Second operand has 39 states, 38 states have (on average 8.526315789473685) internal successors, (324), 35 states have internal predecessors, (324), 17 states have call successors, (60), 9 states have call predecessors, (60), 10 states have return successors, (59), 18 states have call predecessors, (59), 16 states have call successors, (59)