./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'cdd691469d2e12c2dd1871c48be4dd2db0b9d27541ac5dee5ff25a04db0d98eb'] 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_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cdd691469d2e12c2dd1871c48be4dd2db0b9d27541ac5dee5ff25a04db0d98eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:00:42,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:00:42,663 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:00:42,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:00:42,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:00:42,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:00:42,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:00:42,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:00:42,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:00:42,707 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:00:42,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:00:42,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:00:42,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:00:42,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:00:42,708 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:00:42,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:00:42,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:00:42,709 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:00:42,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:00:42,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:00:42,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:00:42,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:00:42,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:00:42,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:00:42,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:00:42,710 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:00:42,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:00:42,710 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:00:42,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:00:42,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:00:42,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:00:42,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:00:42,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:00:42,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:00:42,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:00:42,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:00:42,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:00:42,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:00:42,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:00:42,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:00:42,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:00:42,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:00:42,713 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 -> cdd691469d2e12c2dd1871c48be4dd2db0b9d27541ac5dee5ff25a04db0d98eb [2024-11-07 00:00:43,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:00:43,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:00:43,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:00:43,015 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:00:43,017 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:00:43,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2024-11-07 00:00:44,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:00:44,701 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:00:44,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2024-11-07 00:00:44,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f68ff67f/ba0d9c4ec06e4242846d6bc8fda57f49/FLAGb1f8dcc46 [2024-11-07 00:00:44,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f68ff67f/ba0d9c4ec06e4242846d6bc8fda57f49 [2024-11-07 00:00:44,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:00:44,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:00:44,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:00:44,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:00:44,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:00:44,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:00:44" (1/1) ... [2024-11-07 00:00:44,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10105873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:44, skipping insertion in model container [2024-11-07 00:00:44,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:00:44" (1/1) ... [2024-11-07 00:00:44,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:00:45,027 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_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c[14702,14715] [2024-11-07 00:00:45,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:00:45,041 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:00:45,104 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_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c[14702,14715] [2024-11-07 00:00:45,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:00:45,121 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:00:45,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:45 WrapperNode [2024-11-07 00:00:45,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:00:45,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:00:45,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:00:45,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:00:45,132 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:00:45" (1/1) ... [2024-11-07 00:00:45,151 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:00:45" (1/1) ... [2024-11-07 00:00:45,190 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 510 [2024-11-07 00:00:45,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:00:45,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:00:45,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:00:45,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:00:45,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:45" (1/1) ... [2024-11-07 00:00:45,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:45" (1/1) ... [2024-11-07 00:00:45,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:45" (1/1) ... [2024-11-07 00:00:45,240 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:00:45,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:45" (1/1) ... [2024-11-07 00:00:45,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:45" (1/1) ... [2024-11-07 00:00:45,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:45" (1/1) ... [2024-11-07 00:00:45,268 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:45" (1/1) ... [2024-11-07 00:00:45,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:45" (1/1) ... [2024-11-07 00:00:45,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:45" (1/1) ... [2024-11-07 00:00:45,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:00:45,290 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:00:45,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:00:45,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:00:45,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:45" (1/1) ... [2024-11-07 00:00:45,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:00:45,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:00:45,323 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:00:45,330 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:00:45,350 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-11-07 00:00:45,351 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-11-07 00:00:45,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:00:45,351 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-11-07 00:00:45,351 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-11-07 00:00:45,351 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-07 00:00:45,351 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-07 00:00:45,351 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-11-07 00:00:45,351 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-11-07 00:00:45,352 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 00:00:45,352 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 00:00:45,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:00:45,352 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-11-07 00:00:45,353 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-11-07 00:00:45,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:00:45,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:00:45,353 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-11-07 00:00:45,353 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-11-07 00:00:45,481 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:00:45,484 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:00:46,160 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2024-11-07 00:00:46,161 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:00:46,178 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:00:46,178 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 00:00:46,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:00:46 BoogieIcfgContainer [2024-11-07 00:00:46,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:00:46,181 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:00:46,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:00:46,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:00:46,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:00:44" (1/3) ... [2024-11-07 00:00:46,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e512ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:00:46, skipping insertion in model container [2024-11-07 00:00:46,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:45" (2/3) ... [2024-11-07 00:00:46,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e512ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:00:46, skipping insertion in model container [2024-11-07 00:00:46,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:00:46" (3/3) ... [2024-11-07 00:00:46,191 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2024-11-07 00:00:46,202 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:00:46,203 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:00:46,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:00:46,319 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;@2f144f6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:00:46,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:00:46,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 141 states have (on average 1.553191489361702) internal successors, (219), 142 states have internal predecessors, (219), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 00:00:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 00:00:46,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:46,339 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] [2024-11-07 00:00:46,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:46,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:46,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1494571229, now seen corresponding path program 1 times [2024-11-07 00:00:46,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:46,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855441062] [2024-11-07 00:00:46,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:46,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:46,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:00:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:46,640 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:00:46,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:46,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855441062] [2024-11-07 00:00:46,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855441062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:46,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:46,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 00:00:46,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689916794] [2024-11-07 00:00:46,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:46,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 00:00:46,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:46,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 00:00:46,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:00:46,667 INFO L87 Difference]: Start difference. First operand has 181 states, 141 states have (on average 1.553191489361702) internal successors, (219), 142 states have internal predecessors, (219), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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:00:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:46,703 INFO L93 Difference]: Finished difference Result 346 states and 562 transitions. [2024-11-07 00:00:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 00:00:46,705 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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 28 [2024-11-07 00:00:46,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:46,713 INFO L225 Difference]: With dead ends: 346 [2024-11-07 00:00:46,713 INFO L226 Difference]: Without dead ends: 177 [2024-11-07 00:00:46,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:00:46,720 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:46,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-07 00:00:46,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-07 00:00:46,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 138 states have (on average 1.536231884057971) internal successors, (212), 138 states have internal predecessors, (212), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 00:00:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 274 transitions. [2024-11-07 00:00:46,799 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 274 transitions. Word has length 28 [2024-11-07 00:00:46,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:46,799 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 274 transitions. [2024-11-07 00:00:46,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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:00:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 274 transitions. [2024-11-07 00:00:46,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 00:00:46,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:46,803 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] [2024-11-07 00:00:46,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:00:46,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:46,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:46,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1713425947, now seen corresponding path program 1 times [2024-11-07 00:00:46,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:46,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992037134] [2024-11-07 00:00:46,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:46,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:47,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:00:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:47,138 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:00:47,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:47,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992037134] [2024-11-07 00:00:47,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992037134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:47,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:47,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:00:47,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351183975] [2024-11-07 00:00:47,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:47,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:00:47,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:47,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:00:47,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:00:47,143 INFO L87 Difference]: Start difference. First operand 177 states and 274 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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:00:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:47,290 INFO L93 Difference]: Finished difference Result 453 states and 709 transitions. [2024-11-07 00:00:47,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:00:47,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 28 [2024-11-07 00:00:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:47,295 INFO L225 Difference]: With dead ends: 453 [2024-11-07 00:00:47,295 INFO L226 Difference]: Without dead ends: 290 [2024-11-07 00:00:47,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:00:47,299 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 134 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:47,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1317 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:00:47,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-07 00:00:47,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 177. [2024-11-07 00:00:47,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 138 states have (on average 1.4492753623188406) internal successors, (200), 138 states have internal predecessors, (200), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 00:00:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 262 transitions. [2024-11-07 00:00:47,323 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 262 transitions. Word has length 28 [2024-11-07 00:00:47,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:47,323 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 262 transitions. [2024-11-07 00:00:47,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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:00:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 262 transitions. [2024-11-07 00:00:47,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 00:00:47,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:47,326 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:47,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:00:47,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:47,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:47,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1150379712, now seen corresponding path program 1 times [2024-11-07 00:00:47,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:47,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979086780] [2024-11-07 00:00:47,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:47,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:47,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:47,653 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:00:47,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:47,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979086780] [2024-11-07 00:00:47,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979086780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:47,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:47,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:00:47,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652213784] [2024-11-07 00:00:47,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:47,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:00:47,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:47,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:00:47,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:00:47,656 INFO L87 Difference]: Start difference. First operand 177 states and 262 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, (3), 3 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:00:47,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:47,733 INFO L93 Difference]: Finished difference Result 341 states and 514 transitions. [2024-11-07 00:00:47,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:00:47,733 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, (3), 3 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 39 [2024-11-07 00:00:47,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:47,735 INFO L225 Difference]: With dead ends: 341 [2024-11-07 00:00:47,735 INFO L226 Difference]: Without dead ends: 181 [2024-11-07 00:00:47,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:00:47,737 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 3 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:47,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 758 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-07 00:00:47,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-07 00:00:47,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 141 states have (on average 1.4397163120567376) internal successors, (203), 141 states have internal predecessors, (203), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 00:00:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 265 transitions. [2024-11-07 00:00:47,764 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 265 transitions. Word has length 39 [2024-11-07 00:00:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:47,765 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 265 transitions. [2024-11-07 00:00:47,765 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, (3), 3 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:00:47,765 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 265 transitions. [2024-11-07 00:00:47,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 00:00:47,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:47,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:47,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:00:47,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:47,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:47,769 INFO L85 PathProgramCache]: Analyzing trace with hash -536779374, now seen corresponding path program 1 times [2024-11-07 00:00:47,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:47,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057371887] [2024-11-07 00:00:47,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:47,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:47,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:47,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:47,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 00:00:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 00:00:47,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:47,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057371887] [2024-11-07 00:00:47,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057371887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:47,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:47,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:00:47,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353377444] [2024-11-07 00:00:47,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:47,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:00:47,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:47,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:00:47,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:00:47,923 INFO L87 Difference]: Start difference. First operand 181 states and 265 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 00:00:47,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:47,959 INFO L93 Difference]: Finished difference Result 497 states and 738 transitions. [2024-11-07 00:00:47,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:00:47,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2024-11-07 00:00:47,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:47,962 INFO L225 Difference]: With dead ends: 497 [2024-11-07 00:00:47,962 INFO L226 Difference]: Without dead ends: 333 [2024-11-07 00:00:47,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:00:47,963 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 213 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:47,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 525 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:47,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-07 00:00:47,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 327. [2024-11-07 00:00:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 250 states have (on average 1.46) internal successors, (365), 251 states have internal predecessors, (365), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 00:00:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 485 transitions. [2024-11-07 00:00:47,995 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 485 transitions. Word has length 55 [2024-11-07 00:00:47,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:47,996 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 485 transitions. [2024-11-07 00:00:47,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 00:00:47,996 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 485 transitions. [2024-11-07 00:00:47,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:00:47,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:47,997 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, 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:00:47,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:00:47,998 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:47,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:47,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1864543556, now seen corresponding path program 1 times [2024-11-07 00:00:47,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:47,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340157459] [2024-11-07 00:00:47,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:47,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:48,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:48,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:48,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 00:00:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 00:00:48,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:48,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340157459] [2024-11-07 00:00:48,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340157459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:48,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:48,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:00:48,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904789667] [2024-11-07 00:00:48,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:48,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:00:48,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:48,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:00:48,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:00:48,110 INFO L87 Difference]: Start difference. First operand 327 states and 485 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 00:00:48,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:48,174 INFO L93 Difference]: Finished difference Result 920 states and 1376 transitions. [2024-11-07 00:00:48,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:00:48,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2024-11-07 00:00:48,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:48,182 INFO L225 Difference]: With dead ends: 920 [2024-11-07 00:00:48,183 INFO L226 Difference]: Without dead ends: 610 [2024-11-07 00:00:48,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:00:48,185 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 215 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:48,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 547 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:48,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-07 00:00:48,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 604. [2024-11-07 00:00:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 455 states have (on average 1.4703296703296704) internal successors, (669), 458 states have internal predecessors, (669), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-07 00:00:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 903 transitions. [2024-11-07 00:00:48,232 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 903 transitions. Word has length 56 [2024-11-07 00:00:48,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:48,233 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 903 transitions. [2024-11-07 00:00:48,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 00:00:48,236 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 903 transitions. [2024-11-07 00:00:48,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:00:48,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:48,238 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, 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:00:48,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:00:48,238 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:48,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:48,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1150560062, now seen corresponding path program 1 times [2024-11-07 00:00:48,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:48,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100940879] [2024-11-07 00:00:48,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:48,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:48,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:48,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:48,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 00:00:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 00:00:48,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:48,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100940879] [2024-11-07 00:00:48,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100940879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:48,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:48,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:00:48,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910652325] [2024-11-07 00:00:48,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:48,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:00:48,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:48,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:00:48,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:00:48,398 INFO L87 Difference]: Start difference. First operand 604 states and 903 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 00:00:48,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:48,603 INFO L93 Difference]: Finished difference Result 1295 states and 1932 transitions. [2024-11-07 00:00:48,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:00:48,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2024-11-07 00:00:48,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:48,611 INFO L225 Difference]: With dead ends: 1295 [2024-11-07 00:00:48,612 INFO L226 Difference]: Without dead ends: 708 [2024-11-07 00:00:48,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:48,616 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 369 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:48,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 672 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:00:48,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-11-07 00:00:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 692. [2024-11-07 00:00:48,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 530 states have (on average 1.4547169811320755) internal successors, (771), 533 states have internal predecessors, (771), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-07 00:00:48,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1019 transitions. [2024-11-07 00:00:48,696 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1019 transitions. Word has length 56 [2024-11-07 00:00:48,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:48,697 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 1019 transitions. [2024-11-07 00:00:48,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 00:00:48,697 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1019 transitions. [2024-11-07 00:00:48,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 00:00:48,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:48,699 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, 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:00:48,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:00:48,699 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:48,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:48,699 INFO L85 PathProgramCache]: Analyzing trace with hash 984808241, now seen corresponding path program 1 times [2024-11-07 00:00:48,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:48,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818765929] [2024-11-07 00:00:48,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:48,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:48,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:48,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:48,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:00:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 00:00:48,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:48,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818765929] [2024-11-07 00:00:48,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818765929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:48,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:48,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:00:48,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39164356] [2024-11-07 00:00:48,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:48,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:00:48,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:48,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:00:48,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:00:48,895 INFO L87 Difference]: Start difference. First operand 692 states and 1019 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 00:00:49,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:49,090 INFO L93 Difference]: Finished difference Result 1299 states and 1932 transitions. [2024-11-07 00:00:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:00:49,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 57 [2024-11-07 00:00:49,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:49,096 INFO L225 Difference]: With dead ends: 1299 [2024-11-07 00:00:49,096 INFO L226 Difference]: Without dead ends: 712 [2024-11-07 00:00:49,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:49,099 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 369 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:49,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 672 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:00:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2024-11-07 00:00:49,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 700. [2024-11-07 00:00:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 538 states have (on average 1.4479553903345725) internal successors, (779), 541 states have internal predecessors, (779), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-07 00:00:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1027 transitions. [2024-11-07 00:00:49,187 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1027 transitions. Word has length 57 [2024-11-07 00:00:49,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:49,187 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 1027 transitions. [2024-11-07 00:00:49,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 00:00:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1027 transitions. [2024-11-07 00:00:49,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 00:00:49,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:49,188 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, 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:00:49,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:00:49,189 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:49,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:49,189 INFO L85 PathProgramCache]: Analyzing trace with hash 461948067, now seen corresponding path program 1 times [2024-11-07 00:00:49,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:49,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476051992] [2024-11-07 00:00:49,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:49,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:49,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:49,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:49,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 00:00:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 00:00:49,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:49,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476051992] [2024-11-07 00:00:49,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476051992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:49,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:49,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:00:49,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648568428] [2024-11-07 00:00:49,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:49,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:00:49,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:49,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:00:49,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:00:49,357 INFO L87 Difference]: Start difference. First operand 700 states and 1027 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 00:00:49,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:49,527 INFO L93 Difference]: Finished difference Result 1287 states and 1912 transitions. [2024-11-07 00:00:49,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:00:49,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2024-11-07 00:00:49,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:49,535 INFO L225 Difference]: With dead ends: 1287 [2024-11-07 00:00:49,535 INFO L226 Difference]: Without dead ends: 700 [2024-11-07 00:00:49,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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:00:49,538 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 61 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:49,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 666 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:00:49,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-07 00:00:49,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2024-11-07 00:00:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 538 states have (on average 1.4405204460966543) internal successors, (775), 541 states have internal predecessors, (775), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-07 00:00:49,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1023 transitions. [2024-11-07 00:00:49,593 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1023 transitions. Word has length 59 [2024-11-07 00:00:49,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:49,593 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 1023 transitions. [2024-11-07 00:00:49,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 00:00:49,594 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1023 transitions. [2024-11-07 00:00:49,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 00:00:49,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:49,596 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, 1, 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:00:49,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:00:49,596 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:49,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:49,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1405034612, now seen corresponding path program 1 times [2024-11-07 00:00:49,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:49,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957414931] [2024-11-07 00:00:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:49,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:49,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:49,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:49,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 00:00:49,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:49,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957414931] [2024-11-07 00:00:49,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957414931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:49,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:49,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:00:49,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436525540] [2024-11-07 00:00:49,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:49,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:00:49,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:49,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:00:49,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:00:49,843 INFO L87 Difference]: Start difference. First operand 700 states and 1023 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 00:00:49,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:49,913 INFO L93 Difference]: Finished difference Result 1307 states and 1936 transitions. [2024-11-07 00:00:49,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:00:49,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2024-11-07 00:00:49,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:49,920 INFO L225 Difference]: With dead ends: 1307 [2024-11-07 00:00:49,920 INFO L226 Difference]: Without dead ends: 720 [2024-11-07 00:00:49,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:00:49,923 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 4 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:49,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 770 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:49,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-11-07 00:00:49,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2024-11-07 00:00:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 554 states have (on average 1.4277978339350181) internal successors, (791), 557 states have internal predecessors, (791), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-07 00:00:49,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1039 transitions. [2024-11-07 00:00:49,973 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1039 transitions. Word has length 60 [2024-11-07 00:00:49,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:49,973 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1039 transitions. [2024-11-07 00:00:49,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 00:00:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1039 transitions. [2024-11-07 00:00:49,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 00:00:49,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:49,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:49,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:00:49,975 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:49,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:49,976 INFO L85 PathProgramCache]: Analyzing trace with hash -829990638, now seen corresponding path program 1 times [2024-11-07 00:00:49,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:49,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514629828] [2024-11-07 00:00:49,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:49,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:50,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:50,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:50,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:50,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 00:00:50,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:50,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514629828] [2024-11-07 00:00:50,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514629828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:50,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:50,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:00:50,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766706375] [2024-11-07 00:00:50,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:50,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:00:50,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:50,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:00:50,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:00:50,193 INFO L87 Difference]: Start difference. First operand 720 states and 1039 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 00:00:50,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:50,277 INFO L93 Difference]: Finished difference Result 1347 states and 1980 transitions. [2024-11-07 00:00:50,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:00:50,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2024-11-07 00:00:50,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:50,285 INFO L225 Difference]: With dead ends: 1347 [2024-11-07 00:00:50,285 INFO L226 Difference]: Without dead ends: 740 [2024-11-07 00:00:50,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:00:50,290 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 4 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:50,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 756 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:50,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2024-11-07 00:00:50,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2024-11-07 00:00:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 570 states have (on average 1.4157894736842105) internal successors, (807), 573 states have internal predecessors, (807), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-07 00:00:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1055 transitions. [2024-11-07 00:00:50,345 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1055 transitions. Word has length 68 [2024-11-07 00:00:50,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:50,345 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1055 transitions. [2024-11-07 00:00:50,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 00:00:50,345 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1055 transitions. [2024-11-07 00:00:50,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 00:00:50,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:50,347 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:50,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:00:50,348 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:50,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:50,349 INFO L85 PathProgramCache]: Analyzing trace with hash 102970172, now seen corresponding path program 1 times [2024-11-07 00:00:50,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:50,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93706293] [2024-11-07 00:00:50,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:50,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:50,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:50,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:50,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:50,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:50,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:00:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:50,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 00:00:50,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:50,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93706293] [2024-11-07 00:00:50,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93706293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:50,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:50,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:00:50,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706899637] [2024-11-07 00:00:50,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:50,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:00:50,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:50,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:00:50,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:00:50,593 INFO L87 Difference]: Start difference. First operand 740 states and 1055 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 00:00:50,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:50,667 INFO L93 Difference]: Finished difference Result 1383 states and 1996 transitions. [2024-11-07 00:00:50,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:00:50,668 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2024-11-07 00:00:50,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:50,673 INFO L225 Difference]: With dead ends: 1383 [2024-11-07 00:00:50,673 INFO L226 Difference]: Without dead ends: 756 [2024-11-07 00:00:50,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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:00:50,676 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 3 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:50,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 766 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-11-07 00:00:50,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2024-11-07 00:00:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 582 states have (on average 1.407216494845361) internal successors, (819), 585 states have internal predecessors, (819), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-07 00:00:50,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1067 transitions. [2024-11-07 00:00:50,729 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1067 transitions. Word has length 76 [2024-11-07 00:00:50,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:50,730 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1067 transitions. [2024-11-07 00:00:50,730 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 00:00:50,730 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1067 transitions. [2024-11-07 00:00:50,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 00:00:50,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:50,731 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:50,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:00:50,732 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:50,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:50,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1795537821, now seen corresponding path program 1 times [2024-11-07 00:00:50,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:50,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053710316] [2024-11-07 00:00:50,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:50,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:50,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:50,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:50,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:50,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:50,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:00:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 00:00:50,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:50,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053710316] [2024-11-07 00:00:50,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053710316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:50,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:50,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:00:50,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428580057] [2024-11-07 00:00:50,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:50,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:00:50,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:50,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:00:50,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:00:50,958 INFO L87 Difference]: Start difference. First operand 756 states and 1067 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 00:00:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:51,070 INFO L93 Difference]: Finished difference Result 1419 states and 2036 transitions. [2024-11-07 00:00:51,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:00:51,074 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2024-11-07 00:00:51,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:51,083 INFO L225 Difference]: With dead ends: 1419 [2024-11-07 00:00:51,084 INFO L226 Difference]: Without dead ends: 776 [2024-11-07 00:00:51,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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:00:51,087 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 4 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:51,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 756 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:51,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-11-07 00:00:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2024-11-07 00:00:51,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 598 states have (on average 1.3963210702341138) internal successors, (835), 601 states have internal predecessors, (835), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-07 00:00:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1083 transitions. [2024-11-07 00:00:51,152 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1083 transitions. Word has length 76 [2024-11-07 00:00:51,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:51,153 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1083 transitions. [2024-11-07 00:00:51,153 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 00:00:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1083 transitions. [2024-11-07 00:00:51,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 00:00:51,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:51,156 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:51,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:00:51,156 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:51,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:51,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1351818595, now seen corresponding path program 1 times [2024-11-07 00:00:51,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:51,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862365871] [2024-11-07 00:00:51,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:51,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:51,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:51,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:51,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:51,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:51,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:00:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:51,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:00:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 00:00:51,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:51,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862365871] [2024-11-07 00:00:51,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862365871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:51,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:51,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:00:51,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690591663] [2024-11-07 00:00:51,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:51,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:00:51,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:51,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:00:51,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:00:51,398 INFO L87 Difference]: Start difference. First operand 776 states and 1083 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 00:00:51,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:51,471 INFO L93 Difference]: Finished difference Result 1463 states and 2064 transitions. [2024-11-07 00:00:51,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:00:51,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 84 [2024-11-07 00:00:51,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:51,478 INFO L225 Difference]: With dead ends: 1463 [2024-11-07 00:00:51,479 INFO L226 Difference]: Without dead ends: 800 [2024-11-07 00:00:51,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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:00:51,481 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 5 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:51,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 768 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:51,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-07 00:00:51,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2024-11-07 00:00:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 618 states have (on average 1.383495145631068) internal successors, (855), 621 states have internal predecessors, (855), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-07 00:00:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1103 transitions. [2024-11-07 00:00:51,533 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1103 transitions. Word has length 84 [2024-11-07 00:00:51,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:51,533 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1103 transitions. [2024-11-07 00:00:51,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 00:00:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1103 transitions. [2024-11-07 00:00:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 00:00:51,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:51,536 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:51,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:00:51,536 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:51,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:51,537 INFO L85 PathProgramCache]: Analyzing trace with hash 938140804, now seen corresponding path program 1 times [2024-11-07 00:00:51,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:51,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667186468] [2024-11-07 00:00:51,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:51,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:00:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:00:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 00:00:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-07 00:00:52,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:52,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667186468] [2024-11-07 00:00:52,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667186468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:52,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:52,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:52,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578951672] [2024-11-07 00:00:52,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:52,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:52,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:52,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:52,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:52,186 INFO L87 Difference]: Start difference. First operand 800 states and 1103 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 00:00:52,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:52,545 INFO L93 Difference]: Finished difference Result 2059 states and 2829 transitions. [2024-11-07 00:00:52,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:00:52,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 87 [2024-11-07 00:00:52,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:52,555 INFO L225 Difference]: With dead ends: 2059 [2024-11-07 00:00:52,555 INFO L226 Difference]: Without dead ends: 1372 [2024-11-07 00:00:52,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:00:52,559 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 197 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:52,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1482 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:00:52,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2024-11-07 00:00:52,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1084. [2024-11-07 00:00:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 829 states have (on average 1.3715319662243668) internal successors, (1137), 834 states have internal predecessors, (1137), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2024-11-07 00:00:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1481 transitions. [2024-11-07 00:00:52,651 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1481 transitions. Word has length 87 [2024-11-07 00:00:52,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:52,651 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1481 transitions. [2024-11-07 00:00:52,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 00:00:52,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1481 transitions. [2024-11-07 00:00:52,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 00:00:52,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:52,653 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:52,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:00:52,654 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:52,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:52,654 INFO L85 PathProgramCache]: Analyzing trace with hash -262931398, now seen corresponding path program 1 times [2024-11-07 00:00:52,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:52,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897446182] [2024-11-07 00:00:52,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:52,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:00:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:00:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 00:00:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-07 00:00:52,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:52,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897446182] [2024-11-07 00:00:52,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897446182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:52,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:52,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:00:52,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026425669] [2024-11-07 00:00:52,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:52,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:00:52,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:52,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:00:52,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:00:52,854 INFO L87 Difference]: Start difference. First operand 1084 states and 1481 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 00:00:52,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:52,944 INFO L93 Difference]: Finished difference Result 2011 states and 2772 transitions. [2024-11-07 00:00:52,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:00:52,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 91 [2024-11-07 00:00:52,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:52,952 INFO L225 Difference]: With dead ends: 2011 [2024-11-07 00:00:52,952 INFO L226 Difference]: Without dead ends: 1108 [2024-11-07 00:00:52,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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:00:52,955 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 3 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:52,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 766 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:52,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2024-11-07 00:00:53,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2024-11-07 00:00:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 847 states have (on average 1.3636363636363635) internal successors, (1155), 852 states have internal predecessors, (1155), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2024-11-07 00:00:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1499 transitions. [2024-11-07 00:00:53,035 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1499 transitions. Word has length 91 [2024-11-07 00:00:53,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:53,036 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1499 transitions. [2024-11-07 00:00:53,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 00:00:53,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1499 transitions. [2024-11-07 00:00:53,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 00:00:53,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:53,038 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:53,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:00:53,038 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:53,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:53,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1171844932, now seen corresponding path program 1 times [2024-11-07 00:00:53,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:53,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457502587] [2024-11-07 00:00:53,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:53,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:00:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:00:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 00:00:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 00:00:53,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:53,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457502587] [2024-11-07 00:00:53,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457502587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:53,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:53,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:00:53,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583255367] [2024-11-07 00:00:53,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:53,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:00:53,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:53,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:00:53,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:00:53,412 INFO L87 Difference]: Start difference. First operand 1108 states and 1499 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 00:00:53,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:53,619 INFO L93 Difference]: Finished difference Result 1540 states and 2191 transitions. [2024-11-07 00:00:53,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:00:53,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2024-11-07 00:00:53,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:53,629 INFO L225 Difference]: With dead ends: 1540 [2024-11-07 00:00:53,630 INFO L226 Difference]: Without dead ends: 1538 [2024-11-07 00:00:53,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 00:00:53,632 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 137 mSDsluCounter, 2485 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 2933 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:53,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 2933 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:00:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2024-11-07 00:00:53,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1116. [2024-11-07 00:00:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 851 states have (on average 1.3619271445358403) internal successors, (1159), 858 states have internal predecessors, (1159), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2024-11-07 00:00:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1507 transitions. [2024-11-07 00:00:53,742 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1507 transitions. Word has length 90 [2024-11-07 00:00:53,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:53,742 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1507 transitions. [2024-11-07 00:00:53,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 00:00:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1507 transitions. [2024-11-07 00:00:53,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 00:00:53,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:53,745 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:53,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:00:53,745 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:53,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:53,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1049695796, now seen corresponding path program 1 times [2024-11-07 00:00:53,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:53,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325158876] [2024-11-07 00:00:53,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:53,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:00:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:00:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 00:00:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 00:00:53,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:53,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325158876] [2024-11-07 00:00:53,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325158876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:53,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:53,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:53,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087938942] [2024-11-07 00:00:53,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:53,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:53,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:53,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:53,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:53,953 INFO L87 Difference]: Start difference. First operand 1116 states and 1507 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 00:00:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:54,187 INFO L93 Difference]: Finished difference Result 2016 states and 2732 transitions. [2024-11-07 00:00:54,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:00:54,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 93 [2024-11-07 00:00:54,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:54,204 INFO L225 Difference]: With dead ends: 2016 [2024-11-07 00:00:54,204 INFO L226 Difference]: Without dead ends: 1163 [2024-11-07 00:00:54,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:00:54,210 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 256 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:54,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1491 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:00:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2024-11-07 00:00:54,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1121. [2024-11-07 00:00:54,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 867 states have (on average 1.3517877739331026) internal successors, (1172), 879 states have internal predecessors, (1172), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2024-11-07 00:00:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1496 transitions. [2024-11-07 00:00:54,334 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1496 transitions. Word has length 93 [2024-11-07 00:00:54,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:54,337 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1496 transitions. [2024-11-07 00:00:54,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 00:00:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1496 transitions. [2024-11-07 00:00:54,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 00:00:54,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:54,339 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:54,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:00:54,339 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:54,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:54,340 INFO L85 PathProgramCache]: Analyzing trace with hash 82901354, now seen corresponding path program 1 times [2024-11-07 00:00:54,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:54,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975727468] [2024-11-07 00:00:54,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:54,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:54,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:54,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:54,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:54,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:54,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:00:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:54,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:00:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:54,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 00:00:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:54,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 00:00:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:54,918 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 00:00:54,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:54,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975727468] [2024-11-07 00:00:54,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975727468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:54,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:54,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:54,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846000314] [2024-11-07 00:00:54,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:54,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:54,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:54,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:54,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:54,920 INFO L87 Difference]: Start difference. First operand 1121 states and 1496 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 00:00:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:55,155 INFO L93 Difference]: Finished difference Result 1997 states and 2677 transitions. [2024-11-07 00:00:55,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:00:55,156 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2024-11-07 00:00:55,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:55,163 INFO L225 Difference]: With dead ends: 1997 [2024-11-07 00:00:55,163 INFO L226 Difference]: Without dead ends: 1119 [2024-11-07 00:00:55,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:00:55,167 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 151 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:55,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1607 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:00:55,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2024-11-07 00:00:55,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1011. [2024-11-07 00:00:55,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 784 states have (on average 1.3545918367346939) internal successors, (1062), 794 states have internal predecessors, (1062), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2024-11-07 00:00:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1352 transitions. [2024-11-07 00:00:55,239 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1352 transitions. Word has length 95 [2024-11-07 00:00:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:55,239 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1352 transitions. [2024-11-07 00:00:55,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 00:00:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1352 transitions. [2024-11-07 00:00:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:00:55,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:55,241 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:55,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:00:55,241 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:55,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:55,242 INFO L85 PathProgramCache]: Analyzing trace with hash -914641030, now seen corresponding path program 1 times [2024-11-07 00:00:55,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:55,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782427402] [2024-11-07 00:00:55,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:55,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:00:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:00:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 00:00:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 00:00:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 00:00:55,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:55,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782427402] [2024-11-07 00:00:55,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782427402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:55,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:55,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:55,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56046286] [2024-11-07 00:00:55,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:55,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:55,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:55,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:55,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:55,745 INFO L87 Difference]: Start difference. First operand 1011 states and 1352 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:00:56,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:56,221 INFO L93 Difference]: Finished difference Result 1941 states and 2593 transitions. [2024-11-07 00:00:56,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:00:56,222 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 96 [2024-11-07 00:00:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:56,229 INFO L225 Difference]: With dead ends: 1941 [2024-11-07 00:00:56,230 INFO L226 Difference]: Without dead ends: 1103 [2024-11-07 00:00:56,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:00:56,232 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 521 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:56,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1436 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:00:56,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2024-11-07 00:00:56,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1049. [2024-11-07 00:00:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 807 states have (on average 1.3333333333333333) internal successors, (1076), 818 states have internal predecessors, (1076), 154 states have call successors, (154), 87 states have call predecessors, (154), 87 states have return successors, (154), 143 states have call predecessors, (154), 154 states have call successors, (154) [2024-11-07 00:00:56,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1384 transitions. [2024-11-07 00:00:56,364 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1384 transitions. Word has length 96 [2024-11-07 00:00:56,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:56,365 INFO L471 AbstractCegarLoop]: Abstraction has 1049 states and 1384 transitions. [2024-11-07 00:00:56,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:00:56,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1384 transitions. [2024-11-07 00:00:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 00:00:56,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:56,367 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:56,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:00:56,367 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:56,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:56,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1015746611, now seen corresponding path program 1 times [2024-11-07 00:00:56,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:56,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756832511] [2024-11-07 00:00:56,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:56,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:00:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:00:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 00:00:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 00:00:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:00:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:00:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 00:00:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 00:00:56,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:56,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756832511] [2024-11-07 00:00:56,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756832511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:56,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:56,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:56,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341252845] [2024-11-07 00:00:56,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:56,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:56,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:56,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:56,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:56,915 INFO L87 Difference]: Start difference. First operand 1049 states and 1384 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 00:00:57,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:57,397 INFO L93 Difference]: Finished difference Result 2028 states and 2661 transitions. [2024-11-07 00:00:57,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:00:57,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 98 [2024-11-07 00:00:57,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:57,406 INFO L225 Difference]: With dead ends: 2028 [2024-11-07 00:00:57,406 INFO L226 Difference]: Without dead ends: 1165 [2024-11-07 00:00:57,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:00:57,409 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 409 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:57,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1271 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:00:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2024-11-07 00:00:57,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1071. [2024-11-07 00:00:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 821 states have (on average 1.317904993909866) internal successors, (1082), 833 states have internal predecessors, (1082), 157 states have call successors, (157), 92 states have call predecessors, (157), 92 states have return successors, (157), 145 states have call predecessors, (157), 157 states have call successors, (157) [2024-11-07 00:00:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1396 transitions. [2024-11-07 00:00:57,526 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1396 transitions. Word has length 98 [2024-11-07 00:00:57,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:57,527 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1396 transitions. [2024-11-07 00:00:57,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 00:00:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1396 transitions. [2024-11-07 00:00:57,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:00:57,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:57,529 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:57,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 00:00:57,529 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:57,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:57,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1023582542, now seen corresponding path program 1 times [2024-11-07 00:00:57,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:57,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825250445] [2024-11-07 00:00:57,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:57,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:57,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:57,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:00:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:57,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 00:00:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:57,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:00:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:57,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 00:00:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:57,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 00:00:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:57,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 00:00:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:57,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 00:00:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 00:00:57,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:57,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825250445] [2024-11-07 00:00:57,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825250445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:57,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:57,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:00:57,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347854261] [2024-11-07 00:00:57,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:57,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:00:57,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:57,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:00:57,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:00:57,660 INFO L87 Difference]: Start difference. First operand 1071 states and 1396 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:00:57,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:57,920 INFO L93 Difference]: Finished difference Result 2787 states and 3662 transitions. [2024-11-07 00:00:57,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:00:57,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2024-11-07 00:00:57,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:57,934 INFO L225 Difference]: With dead ends: 2787 [2024-11-07 00:00:57,934 INFO L226 Difference]: Without dead ends: 1980 [2024-11-07 00:00:57,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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:00:57,939 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 200 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:57,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1154 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:57,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2024-11-07 00:00:58,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1797. [2024-11-07 00:00:58,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1359 states have (on average 1.3200883002207506) internal successors, (1794), 1379 states have internal predecessors, (1794), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2024-11-07 00:00:58,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2354 transitions. [2024-11-07 00:00:58,151 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2354 transitions. Word has length 99 [2024-11-07 00:00:58,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:58,151 INFO L471 AbstractCegarLoop]: Abstraction has 1797 states and 2354 transitions. [2024-11-07 00:00:58,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:00:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2354 transitions. [2024-11-07 00:00:58,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:00:58,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:58,154 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:58,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 00:00:58,154 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:58,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:58,155 INFO L85 PathProgramCache]: Analyzing trace with hash 506581735, now seen corresponding path program 1 times [2024-11-07 00:00:58,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:58,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281179986] [2024-11-07 00:00:58,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:58,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:00:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 00:00:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:00:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 00:00:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 00:00:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 00:00:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 00:00:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 00:00:58,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:58,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281179986] [2024-11-07 00:00:58,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281179986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:58,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:58,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:00:58,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5191285] [2024-11-07 00:00:58,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:58,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:00:58,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:58,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:00:58,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:00:58,295 INFO L87 Difference]: Start difference. First operand 1797 states and 2354 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:00:58,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:58,641 INFO L93 Difference]: Finished difference Result 4559 states and 6008 transitions. [2024-11-07 00:00:58,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:00:58,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 101 [2024-11-07 00:00:58,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:58,662 INFO L225 Difference]: With dead ends: 4559 [2024-11-07 00:00:58,662 INFO L226 Difference]: Without dead ends: 3099 [2024-11-07 00:00:58,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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:00:58,672 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 208 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:58,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1192 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2024-11-07 00:00:59,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 2818. [2024-11-07 00:00:59,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2105 states have (on average 1.3116389548693588) internal successors, (2761), 2136 states have internal predecessors, (2761), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2024-11-07 00:00:59,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 3681 transitions. [2024-11-07 00:00:59,087 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 3681 transitions. Word has length 101 [2024-11-07 00:00:59,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:59,089 INFO L471 AbstractCegarLoop]: Abstraction has 2818 states and 3681 transitions. [2024-11-07 00:00:59,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:00:59,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 3681 transitions. [2024-11-07 00:00:59,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:00:59,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:59,093 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:59,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 00:00:59,094 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:59,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:59,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1826960265, now seen corresponding path program 1 times [2024-11-07 00:00:59,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:59,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750086458] [2024-11-07 00:00:59,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:59,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:59,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:59,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:00:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:59,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:59,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 00:00:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:59,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 00:00:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:59,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 00:00:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:59,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 00:00:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:59,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:00:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:59,229 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 00:00:59,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:59,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750086458] [2024-11-07 00:00:59,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750086458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:59,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:59,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:00:59,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515069933] [2024-11-07 00:00:59,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:59,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:00:59,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:59,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:00:59,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:00:59,233 INFO L87 Difference]: Start difference. First operand 2818 states and 3681 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:00:59,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:59,686 INFO L93 Difference]: Finished difference Result 6581 states and 8639 transitions. [2024-11-07 00:00:59,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:00:59,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 101 [2024-11-07 00:00:59,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:59,731 INFO L225 Difference]: With dead ends: 6581 [2024-11-07 00:00:59,731 INFO L226 Difference]: Without dead ends: 4220 [2024-11-07 00:00:59,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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:00:59,741 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 201 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:59,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1206 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:00:59,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4220 states. [2024-11-07 00:01:00,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4220 to 4035. [2024-11-07 00:01:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4035 states, 2998 states have (on average 1.3082054703135424) internal successors, (3922), 3042 states have internal predecessors, (3922), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-11-07 00:01:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4035 states to 4035 states and 5266 transitions. [2024-11-07 00:01:00,229 INFO L78 Accepts]: Start accepts. Automaton has 4035 states and 5266 transitions. Word has length 101 [2024-11-07 00:01:00,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:00,230 INFO L471 AbstractCegarLoop]: Abstraction has 4035 states and 5266 transitions. [2024-11-07 00:01:00,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:01:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 4035 states and 5266 transitions. [2024-11-07 00:01:00,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 00:01:00,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:00,233 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:00,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 00:01:00,234 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:00,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:00,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1131002330, now seen corresponding path program 1 times [2024-11-07 00:01:00,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:00,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519389674] [2024-11-07 00:01:00,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:00,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:00,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:00,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 00:01:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:00,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:01:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:00,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 00:01:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:00,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:01:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:00,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 00:01:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:00,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 00:01:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:00,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 00:01:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 00:01:00,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:00,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519389674] [2024-11-07 00:01:00,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519389674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:00,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:00,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:01:00,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702015263] [2024-11-07 00:01:00,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:00,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:01:00,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:00,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:01:00,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:01:00,320 INFO L87 Difference]: Start difference. First operand 4035 states and 5266 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:01:00,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:00,768 INFO L93 Difference]: Finished difference Result 7749 states and 10163 transitions. [2024-11-07 00:01:00,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:01:00,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 102 [2024-11-07 00:01:00,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:00,809 INFO L225 Difference]: With dead ends: 7749 [2024-11-07 00:01:00,810 INFO L226 Difference]: Without dead ends: 4068 [2024-11-07 00:01:00,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:00,822 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 6 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:00,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 487 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:00,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4068 states. [2024-11-07 00:01:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4068 to 4041. [2024-11-07 00:01:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4041 states, 3004 states have (on average 1.307589880159787) internal successors, (3928), 3048 states have internal predecessors, (3928), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-11-07 00:01:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4041 states to 4041 states and 5272 transitions. [2024-11-07 00:01:01,291 INFO L78 Accepts]: Start accepts. Automaton has 4041 states and 5272 transitions. Word has length 102 [2024-11-07 00:01:01,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:01,292 INFO L471 AbstractCegarLoop]: Abstraction has 4041 states and 5272 transitions. [2024-11-07 00:01:01,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:01:01,292 INFO L276 IsEmpty]: Start isEmpty. Operand 4041 states and 5272 transitions. [2024-11-07 00:01:01,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 00:01:01,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:01,295 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:01,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 00:01:01,296 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:01,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:01,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1347241870, now seen corresponding path program 1 times [2024-11-07 00:01:01,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:01,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730143501] [2024-11-07 00:01:01,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:01,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:01:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 00:01:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 00:01:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 00:01:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 00:01:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:01:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 00:01:01,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:01,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730143501] [2024-11-07 00:01:01,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730143501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:01,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:01,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:01,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676856180] [2024-11-07 00:01:01,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:01,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:01,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:01,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:01,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:01,455 INFO L87 Difference]: Start difference. First operand 4041 states and 5272 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:01:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:01,957 INFO L93 Difference]: Finished difference Result 7714 states and 10090 transitions. [2024-11-07 00:01:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:01,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 103 [2024-11-07 00:01:01,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:01,984 INFO L225 Difference]: With dead ends: 7714 [2024-11-07 00:01:01,984 INFO L226 Difference]: Without dead ends: 3749 [2024-11-07 00:01:01,999 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:02,000 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 83 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:02,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 749 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:02,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3749 states. [2024-11-07 00:01:02,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3749 to 3686. [2024-11-07 00:01:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3686 states, 2732 states have (on average 1.3177159590043923) internal successors, (3600), 2766 states have internal predecessors, (3600), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-11-07 00:01:02,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 4840 transitions. [2024-11-07 00:01:02,484 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 4840 transitions. Word has length 103 [2024-11-07 00:01:02,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:02,485 INFO L471 AbstractCegarLoop]: Abstraction has 3686 states and 4840 transitions. [2024-11-07 00:01:02,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:01:02,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 4840 transitions. [2024-11-07 00:01:02,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 00:01:02,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:02,487 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:02,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 00:01:02,488 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:02,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:02,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2076713750, now seen corresponding path program 1 times [2024-11-07 00:01:02,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:02,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292249736] [2024-11-07 00:01:02,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:02,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:02,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:02,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 00:01:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:02,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:01:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:02,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 00:01:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:02,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:01:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:02,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 00:01:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:02,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 00:01:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:02,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 00:01:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 00:01:02,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:02,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292249736] [2024-11-07 00:01:02,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292249736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:02,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:02,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:01:02,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746297999] [2024-11-07 00:01:02,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:02,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:01:02,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:02,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:01:02,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:01:02,562 INFO L87 Difference]: Start difference. First operand 3686 states and 4840 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:01:02,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:02,851 INFO L93 Difference]: Finished difference Result 7201 states and 9489 transitions. [2024-11-07 00:01:02,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:01:02,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2024-11-07 00:01:02,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:02,882 INFO L225 Difference]: With dead ends: 7201 [2024-11-07 00:01:02,882 INFO L226 Difference]: Without dead ends: 3696 [2024-11-07 00:01:02,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:02,895 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:02,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:02,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3696 states. [2024-11-07 00:01:03,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3696 to 3696. [2024-11-07 00:01:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 2742 states have (on average 1.3165572574762947) internal successors, (3610), 2776 states have internal predecessors, (3610), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-11-07 00:01:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 4850 transitions. [2024-11-07 00:01:03,206 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 4850 transitions. Word has length 104 [2024-11-07 00:01:03,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:03,207 INFO L471 AbstractCegarLoop]: Abstraction has 3696 states and 4850 transitions. [2024-11-07 00:01:03,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:01:03,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 4850 transitions. [2024-11-07 00:01:03,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 00:01:03,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:03,210 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:03,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 00:01:03,211 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:03,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:03,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2022352177, now seen corresponding path program 1 times [2024-11-07 00:01:03,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:03,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158998983] [2024-11-07 00:01:03,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:03,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:03,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:03,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 00:01:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:03,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:01:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:03,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 00:01:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:03,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:01:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:03,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 00:01:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:03,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 00:01:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:03,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 00:01:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 00:01:03,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:03,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158998983] [2024-11-07 00:01:03,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158998983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:03,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:03,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:03,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128776147] [2024-11-07 00:01:03,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:03,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:03,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:03,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:03,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:03,381 INFO L87 Difference]: Start difference. First operand 3696 states and 4850 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:01:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:03,640 INFO L93 Difference]: Finished difference Result 7193 states and 9461 transitions. [2024-11-07 00:01:03,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:03,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2024-11-07 00:01:03,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:03,663 INFO L225 Difference]: With dead ends: 7193 [2024-11-07 00:01:03,663 INFO L226 Difference]: Without dead ends: 3616 [2024-11-07 00:01:03,675 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:03,676 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 64 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:03,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 759 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:03,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3616 states. [2024-11-07 00:01:03,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3616 to 2785. [2024-11-07 00:01:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2785 states, 2065 states have (on average 1.3113801452784504) internal successors, (2708), 2084 states have internal predecessors, (2708), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2024-11-07 00:01:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 3646 transitions. [2024-11-07 00:01:03,929 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 3646 transitions. Word has length 104 [2024-11-07 00:01:03,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:03,929 INFO L471 AbstractCegarLoop]: Abstraction has 2785 states and 3646 transitions. [2024-11-07 00:01:03,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:01:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 3646 transitions. [2024-11-07 00:01:03,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-07 00:01:03,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:03,936 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 00:01:03,936 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:03,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:03,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1445089110, now seen corresponding path program 1 times [2024-11-07 00:01:03,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:03,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071929150] [2024-11-07 00:01:03,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:03,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:01:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:01:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:01:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 00:01:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 00:01:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 00:01:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 00:01:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 00:01:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 00:01:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 00:01:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 00:01:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-07 00:01:04,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:04,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071929150] [2024-11-07 00:01:04,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071929150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:04,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813277679] [2024-11-07 00:01:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:04,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:04,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:04,318 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:04,319 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:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 00:01:04,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-07 00:01:04,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:04,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813277679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:04,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:04,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-11-07 00:01:04,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518502223] [2024-11-07 00:01:04,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:04,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:01:04,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:04,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:01:04,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 00:01:04,681 INFO L87 Difference]: Start difference. First operand 2785 states and 3646 transitions. Second operand has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-07 00:01:04,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:04,909 INFO L93 Difference]: Finished difference Result 5240 states and 6902 transitions. [2024-11-07 00:01:04,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:04,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 154 [2024-11-07 00:01:04,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:04,928 INFO L225 Difference]: With dead ends: 5240 [2024-11-07 00:01:04,929 INFO L226 Difference]: Without dead ends: 2614 [2024-11-07 00:01:04,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 00:01:04,938 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:04,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1024 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2614 states. [2024-11-07 00:01:05,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2614 to 2598. [2024-11-07 00:01:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2598 states, 1923 states have (on average 1.3078523140925638) internal successors, (2515), 1940 states have internal predecessors, (2515), 440 states have call successors, (440), 234 states have call predecessors, (440), 234 states have return successors, (440), 423 states have call predecessors, (440), 440 states have call successors, (440) [2024-11-07 00:01:05,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 3395 transitions. [2024-11-07 00:01:05,183 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 3395 transitions. Word has length 154 [2024-11-07 00:01:05,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:05,184 INFO L471 AbstractCegarLoop]: Abstraction has 2598 states and 3395 transitions. [2024-11-07 00:01:05,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-07 00:01:05,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3395 transitions. [2024-11-07 00:01:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 00:01:05,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:05,190 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 00:01:05,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-07 00:01:05,391 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:05,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:05,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1661978996, now seen corresponding path program 1 times [2024-11-07 00:01:05,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:05,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490788143] [2024-11-07 00:01:05,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:05,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:01:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 00:01:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:01:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:01:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 00:01:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:01:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:01:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 00:01:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 00:01:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:01:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 00:01:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 00:01:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 00:01:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-07 00:01:06,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:06,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490788143] [2024-11-07 00:01:06,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490788143] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:06,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445197377] [2024-11-07 00:01:06,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:06,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:06,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:06,172 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:06,174 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:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 00:01:06,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:06,871 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 32 proven. 44 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 00:01:06,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-07 00:01:07,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445197377] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:07,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:07,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 24 [2024-11-07 00:01:07,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057322571] [2024-11-07 00:01:07,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:07,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 00:01:07,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:07,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 00:01:07,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-11-07 00:01:07,261 INFO L87 Difference]: Start difference. First operand 2598 states and 3395 transitions. Second operand has 24 states, 24 states have (on average 10.958333333333334) internal successors, (263), 22 states have internal predecessors, (263), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2024-11-07 00:01:12,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:12,527 INFO L93 Difference]: Finished difference Result 7606 states and 9971 transitions. [2024-11-07 00:01:12,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-07 00:01:12,528 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.958333333333334) internal successors, (263), 22 states have internal predecessors, (263), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) Word has length 156 [2024-11-07 00:01:12,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:12,559 INFO L225 Difference]: With dead ends: 7606 [2024-11-07 00:01:12,560 INFO L226 Difference]: Without dead ends: 5234 [2024-11-07 00:01:12,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1798 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1040, Invalid=6100, Unknown=0, NotChecked=0, Total=7140 [2024-11-07 00:01:12,572 INFO L432 NwaCegarLoop]: 658 mSDtfsCounter, 2629 mSDsluCounter, 6805 mSDsCounter, 0 mSdLazyCounter, 3492 mSolverCounterSat, 976 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2629 SdHoareTripleChecker+Valid, 7463 SdHoareTripleChecker+Invalid, 4468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 976 IncrementalHoareTripleChecker+Valid, 3492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:12,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2629 Valid, 7463 Invalid, 4468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [976 Valid, 3492 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 00:01:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5234 states. [2024-11-07 00:01:13,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5234 to 4543. [2024-11-07 00:01:13,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4543 states, 3363 states have (on average 1.3101397561700863) internal successors, (4406), 3392 states have internal predecessors, (4406), 765 states have call successors, (765), 414 states have call predecessors, (765), 414 states have return successors, (765), 736 states have call predecessors, (765), 765 states have call successors, (765) [2024-11-07 00:01:13,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4543 states to 4543 states and 5936 transitions. [2024-11-07 00:01:13,131 INFO L78 Accepts]: Start accepts. Automaton has 4543 states and 5936 transitions. Word has length 156 [2024-11-07 00:01:13,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:13,132 INFO L471 AbstractCegarLoop]: Abstraction has 4543 states and 5936 transitions. [2024-11-07 00:01:13,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.958333333333334) internal successors, (263), 22 states have internal predecessors, (263), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2024-11-07 00:01:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 4543 states and 5936 transitions. [2024-11-07 00:01:13,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 00:01:13,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:13,141 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 00:01:13,345 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,SelfDestructingSolverStorable28 [2024-11-07 00:01:13,346 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:13,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:13,347 INFO L85 PathProgramCache]: Analyzing trace with hash -554573914, now seen corresponding path program 1 times [2024-11-07 00:01:13,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:13,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071419349] [2024-11-07 00:01:13,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:13,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:01:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:01:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 00:01:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 00:01:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:01:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 00:01:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 00:01:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 00:01:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 00:01:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 00:01:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 00:01:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 00:01:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 00:01:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-07 00:01:13,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:13,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071419349] [2024-11-07 00:01:13,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071419349] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:13,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016437728] [2024-11-07 00:01:13,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:13,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:13,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:13,764 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:13,766 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:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-07 00:01:14,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 61 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 00:01:14,502 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-07 00:01:15,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016437728] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:15,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:15,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 22 [2024-11-07 00:01:15,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200433029] [2024-11-07 00:01:15,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:15,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 00:01:15,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:15,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 00:01:15,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2024-11-07 00:01:15,003 INFO L87 Difference]: Start difference. First operand 4543 states and 5936 transitions. Second operand has 22 states, 22 states have (on average 11.318181818181818) internal successors, (249), 22 states have internal predecessors, (249), 9 states have call successors, (37), 5 states have call predecessors, (37), 6 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) [2024-11-07 00:01:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:17,495 INFO L93 Difference]: Finished difference Result 10758 states and 14046 transitions. [2024-11-07 00:01:17,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-07 00:01:17,496 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 11.318181818181818) internal successors, (249), 22 states have internal predecessors, (249), 9 states have call successors, (37), 5 states have call predecessors, (37), 6 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) Word has length 157 [2024-11-07 00:01:17,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:17,531 INFO L225 Difference]: With dead ends: 10758 [2024-11-07 00:01:17,531 INFO L226 Difference]: Without dead ends: 6460 [2024-11-07 00:01:17,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=881, Invalid=2541, Unknown=0, NotChecked=0, Total=3422 [2024-11-07 00:01:17,546 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 2460 mSDsluCounter, 2615 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 840 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2460 SdHoareTripleChecker+Valid, 2936 SdHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 840 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:17,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2460 Valid, 2936 Invalid, 2321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [840 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 00:01:17,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2024-11-07 00:01:18,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 6130. [2024-11-07 00:01:18,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6130 states, 4532 states have (on average 1.3025154457193293) internal successors, (5903), 4572 states have internal predecessors, (5903), 1028 states have call successors, (1028), 569 states have call predecessors, (1028), 569 states have return successors, (1028), 988 states have call predecessors, (1028), 1028 states have call successors, (1028) [2024-11-07 00:01:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6130 states to 6130 states and 7959 transitions. [2024-11-07 00:01:18,389 INFO L78 Accepts]: Start accepts. Automaton has 6130 states and 7959 transitions. Word has length 157 [2024-11-07 00:01:18,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:18,391 INFO L471 AbstractCegarLoop]: Abstraction has 6130 states and 7959 transitions. [2024-11-07 00:01:18,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.318181818181818) internal successors, (249), 22 states have internal predecessors, (249), 9 states have call successors, (37), 5 states have call predecessors, (37), 6 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) [2024-11-07 00:01:18,392 INFO L276 IsEmpty]: Start isEmpty. Operand 6130 states and 7959 transitions. [2024-11-07 00:01:18,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 00:01:18,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:18,403 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,423 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:18,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:18,608 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:18,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:18,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2129400353, now seen corresponding path program 1 times [2024-11-07 00:01:18,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:18,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148477758] [2024-11-07 00:01:18,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:18,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:01:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:01:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 00:01:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 00:01:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:01:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 00:01:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 00:01:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 00:01:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 00:01:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:01:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 00:01:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:01:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 00:01:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-07 00:01:18,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:18,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148477758] [2024-11-07 00:01:18,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148477758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:18,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:18,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:01:18,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721131324] [2024-11-07 00:01:18,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:18,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:01:18,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:18,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:01:18,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:01:18,841 INFO L87 Difference]: Start difference. First operand 6130 states and 7959 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 00:01:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:20,310 INFO L93 Difference]: Finished difference Result 17980 states and 23407 transitions. [2024-11-07 00:01:20,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:01:20,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 159 [2024-11-07 00:01:20,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:20,388 INFO L225 Difference]: With dead ends: 17980 [2024-11-07 00:01:20,388 INFO L226 Difference]: Without dead ends: 12155 [2024-11-07 00:01:20,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:01:20,414 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 224 mSDsluCounter, 2097 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:20,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 2584 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:01:20,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12155 states. [2024-11-07 00:01:21,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12155 to 8614. [2024-11-07 00:01:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8614 states, 6320 states have (on average 1.3012658227848102) internal successors, (8224), 6378 states have internal predecessors, (8224), 1492 states have call successors, (1492), 801 states have call predecessors, (1492), 801 states have return successors, (1492), 1434 states have call predecessors, (1492), 1492 states have call successors, (1492) [2024-11-07 00:01:21,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8614 states to 8614 states and 11208 transitions. [2024-11-07 00:01:21,795 INFO L78 Accepts]: Start accepts. Automaton has 8614 states and 11208 transitions. Word has length 159 [2024-11-07 00:01:21,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:21,796 INFO L471 AbstractCegarLoop]: Abstraction has 8614 states and 11208 transitions. [2024-11-07 00:01:21,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 00:01:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 8614 states and 11208 transitions. [2024-11-07 00:01:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 00:01:21,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:21,813 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 00:01:21,813 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:21,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:21,813 INFO L85 PathProgramCache]: Analyzing trace with hash 713092917, now seen corresponding path program 1 times [2024-11-07 00:01:21,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:21,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567180931] [2024-11-07 00:01:21,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:21,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 00:01:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:01:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 00:01:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 00:01:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 00:01:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 00:01:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 00:01:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 00:01:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:01:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 00:01:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:01:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 00:01:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-07 00:01:22,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:22,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567180931] [2024-11-07 00:01:22,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567180931] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:22,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231882999] [2024-11-07 00:01:22,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:22,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:22,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:22,966 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:22,968 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:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-07 00:01:23,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:23,779 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 59 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 00:01:23,780 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-07 00:01:24,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231882999] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:24,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:24,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 10] total 27 [2024-11-07 00:01:24,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007911861] [2024-11-07 00:01:24,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:24,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 00:01:24,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:24,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 00:01:24,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2024-11-07 00:01:24,682 INFO L87 Difference]: Start difference. First operand 8614 states and 11208 transitions. Second operand has 27 states, 27 states have (on average 8.777777777777779) internal successors, (237), 27 states have internal predecessors, (237), 8 states have call successors, (30), 5 states have call predecessors, (30), 6 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) [2024-11-07 00:01:26,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:26,993 INFO L93 Difference]: Finished difference Result 17637 states and 23003 transitions. [2024-11-07 00:01:26,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 00:01:26,993 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.777777777777779) internal successors, (237), 27 states have internal predecessors, (237), 8 states have call successors, (30), 5 states have call predecessors, (30), 6 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) Word has length 159 [2024-11-07 00:01:26,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:27,049 INFO L225 Difference]: With dead ends: 17637 [2024-11-07 00:01:27,050 INFO L226 Difference]: Without dead ends: 9316 [2024-11-07 00:01:27,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=315, Invalid=1491, Unknown=0, NotChecked=0, Total=1806 [2024-11-07 00:01:27,074 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 1277 mSDsluCounter, 3624 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 4090 SdHoareTripleChecker+Invalid, 2403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:27,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 4090 Invalid, 2403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 2055 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 00:01:27,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9316 states. [2024-11-07 00:01:28,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9316 to 9086. [2024-11-07 00:01:28,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9086 states, 6673 states have (on average 1.3000149857635246) internal successors, (8675), 6735 states have internal predecessors, (8675), 1568 states have call successors, (1568), 844 states have call predecessors, (1568), 844 states have return successors, (1568), 1506 states have call predecessors, (1568), 1568 states have call successors, (1568) [2024-11-07 00:01:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9086 states to 9086 states and 11811 transitions. [2024-11-07 00:01:28,237 INFO L78 Accepts]: Start accepts. Automaton has 9086 states and 11811 transitions. Word has length 159 [2024-11-07 00:01:28,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:28,238 INFO L471 AbstractCegarLoop]: Abstraction has 9086 states and 11811 transitions. [2024-11-07 00:01:28,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.777777777777779) internal successors, (237), 27 states have internal predecessors, (237), 8 states have call successors, (30), 5 states have call predecessors, (30), 6 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) [2024-11-07 00:01:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 9086 states and 11811 transitions. [2024-11-07 00:01:28,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 00:01:28,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:28,254 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,273 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:28,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-07 00:01:28,455 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:28,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:28,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2096956834, now seen corresponding path program 1 times [2024-11-07 00:01:28,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:28,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063192976] [2024-11-07 00:01:28,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:28,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 00:01:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:01:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 00:01:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 00:01:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 00:01:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 00:01:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 00:01:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 00:01:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 00:01:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:01:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 00:01:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 00:01:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-07 00:01:29,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:29,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063192976] [2024-11-07 00:01:29,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063192976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:29,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300474551] [2024-11-07 00:01:29,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:29,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:29,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:29,333 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:29,335 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:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:29,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 00:01:29,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 66 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 00:01:30,033 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:30,560 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-07 00:01:30,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300474551] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:30,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:30,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 24 [2024-11-07 00:01:30,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26351346] [2024-11-07 00:01:30,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:30,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 00:01:30,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:30,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 00:01:30,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2024-11-07 00:01:30,562 INFO L87 Difference]: Start difference. First operand 9086 states and 11811 transitions. Second operand has 24 states, 24 states have (on average 10.625) internal successors, (255), 24 states have internal predecessors, (255), 10 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (37), 10 states have call predecessors, (37), 10 states have call successors, (37) [2024-11-07 00:01:34,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:34,748 INFO L93 Difference]: Finished difference Result 22897 states and 29792 transitions. [2024-11-07 00:01:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-07 00:01:34,748 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.625) internal successors, (255), 24 states have internal predecessors, (255), 10 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (37), 10 states have call predecessors, (37), 10 states have call successors, (37) Word has length 160 [2024-11-07 00:01:34,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:34,819 INFO L225 Difference]: With dead ends: 22897 [2024-11-07 00:01:34,819 INFO L226 Difference]: Without dead ends: 14060 [2024-11-07 00:01:34,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=843, Invalid=3317, Unknown=0, NotChecked=0, Total=4160 [2024-11-07 00:01:34,842 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 4592 mSDsluCounter, 3515 mSDsCounter, 0 mSdLazyCounter, 2453 mSolverCounterSat, 1579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4592 SdHoareTripleChecker+Valid, 3994 SdHoareTripleChecker+Invalid, 4032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1579 IncrementalHoareTripleChecker+Valid, 2453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:34,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4592 Valid, 3994 Invalid, 4032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1579 Valid, 2453 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 00:01:34,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14060 states. [2024-11-07 00:01:36,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14060 to 12949. [2024-11-07 00:01:36,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12949 states, 9488 states have (on average 1.3012225969645868) internal successors, (12346), 9582 states have internal predecessors, (12346), 2251 states have call successors, (2251), 1209 states have call predecessors, (2251), 1209 states have return successors, (2251), 2157 states have call predecessors, (2251), 2251 states have call successors, (2251) [2024-11-07 00:01:36,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12949 states to 12949 states and 16848 transitions. [2024-11-07 00:01:36,931 INFO L78 Accepts]: Start accepts. Automaton has 12949 states and 16848 transitions. Word has length 160 [2024-11-07 00:01:36,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:36,932 INFO L471 AbstractCegarLoop]: Abstraction has 12949 states and 16848 transitions. [2024-11-07 00:01:36,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.625) internal successors, (255), 24 states have internal predecessors, (255), 10 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (37), 10 states have call predecessors, (37), 10 states have call successors, (37) [2024-11-07 00:01:36,932 INFO L276 IsEmpty]: Start isEmpty. Operand 12949 states and 16848 transitions. [2024-11-07 00:01:36,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-07 00:01:36,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:36,946 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-07 00:01:37,149 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,SelfDestructingSolverStorable32 [2024-11-07 00:01:37,150 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:37,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:37,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1293554788, now seen corresponding path program 1 times [2024-11-07 00:01:37,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:37,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342323936] [2024-11-07 00:01:37,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:37,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:01:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:01:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 00:01:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 00:01:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:01:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 00:01:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 00:01:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 00:01:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:01:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 00:01:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 00:01:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:01:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 00:01:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-07 00:01:37,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:37,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342323936] [2024-11-07 00:01:37,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342323936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:37,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289435630] [2024-11-07 00:01:37,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:37,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:37,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:37,501 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:37,503 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:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:37,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 00:01:37,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 00:01:38,136 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-07 00:01:38,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289435630] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:38,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:38,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 22 [2024-11-07 00:01:38,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882024116] [2024-11-07 00:01:38,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:38,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 00:01:38,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:38,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 00:01:38,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2024-11-07 00:01:38,603 INFO L87 Difference]: Start difference. First operand 12949 states and 16848 transitions. Second operand has 22 states, 22 states have (on average 12.136363636363637) internal successors, (267), 22 states have internal predecessors, (267), 9 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) [2024-11-07 00:01:45,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:45,352 INFO L93 Difference]: Finished difference Result 32857 states and 42874 transitions. [2024-11-07 00:01:45,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-11-07 00:01:45,352 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 12.136363636363637) internal successors, (267), 22 states have internal predecessors, (267), 9 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) Word has length 161 [2024-11-07 00:01:45,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:45,457 INFO L225 Difference]: With dead ends: 32857 [2024-11-07 00:01:45,458 INFO L226 Difference]: Without dead ends: 20181 [2024-11-07 00:01:45,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7826 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2712, Invalid=18168, Unknown=0, NotChecked=0, Total=20880 [2024-11-07 00:01:45,497 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 2431 mSDsluCounter, 3881 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 706 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2431 SdHoareTripleChecker+Valid, 4256 SdHoareTripleChecker+Invalid, 3085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 706 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:45,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2431 Valid, 4256 Invalid, 3085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [706 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 00:01:45,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20181 states. [2024-11-07 00:01:48,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20181 to 19026. [2024-11-07 00:01:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19026 states, 14037 states have (on average 1.301132720666809) internal successors, (18264), 14168 states have internal predecessors, (18264), 3225 states have call successors, (3225), 1763 states have call predecessors, (3225), 1763 states have return successors, (3225), 3094 states have call predecessors, (3225), 3225 states have call successors, (3225) [2024-11-07 00:01:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19026 states to 19026 states and 24714 transitions. [2024-11-07 00:01:48,784 INFO L78 Accepts]: Start accepts. Automaton has 19026 states and 24714 transitions. Word has length 161 [2024-11-07 00:01:48,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:48,784 INFO L471 AbstractCegarLoop]: Abstraction has 19026 states and 24714 transitions. [2024-11-07 00:01:48,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 12.136363636363637) internal successors, (267), 22 states have internal predecessors, (267), 9 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) [2024-11-07 00:01:48,785 INFO L276 IsEmpty]: Start isEmpty. Operand 19026 states and 24714 transitions. [2024-11-07 00:01:48,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-07 00:01:48,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:48,800 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,821 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:49,004 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,SelfDestructingSolverStorable33 [2024-11-07 00:01:49,005 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:49,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:49,005 INFO L85 PathProgramCache]: Analyzing trace with hash -393499219, now seen corresponding path program 1 times [2024-11-07 00:01:49,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:49,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776090216] [2024-11-07 00:01:49,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:49,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:01:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:01:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 00:01:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 00:01:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:01:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 00:01:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 00:01:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 00:01:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:01:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 00:01:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 00:01:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:01:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 00:01:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,760 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-07 00:01:49,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:49,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776090216] [2024-11-07 00:01:49,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776090216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:49,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8582547] [2024-11-07 00:01:49,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:49,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:49,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:49,763 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:49,765 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:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:49,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 00:01:49,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-07 00:01:50,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:50,220 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-07 00:01:50,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8582547] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:50,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:50,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2024-11-07 00:01:50,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447269368] [2024-11-07 00:01:50,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:50,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 00:01:50,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:50,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 00:01:50,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-07 00:01:50,223 INFO L87 Difference]: Start difference. First operand 19026 states and 24714 transitions. Second operand has 15 states, 15 states have (on average 13.333333333333334) internal successors, (200), 14 states have internal predecessors, (200), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 6 states have call successors, (34)