./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.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.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', '5c6d968f3bfd626cfd1fff51fa64657ab37ae457da61332877d0ea5ab7fc90f2'] 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.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 5c6d968f3bfd626cfd1fff51fa64657ab37ae457da61332877d0ea5ab7fc90f2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:01:06,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:01:06,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:01:06,877 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:01:06,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:01:06,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:01:06,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:01:06,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:01:06,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:01:06,902 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:01:06,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:01:06,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:01:06,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:01:06,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:01:06,903 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:01:06,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:01:06,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:01:06,904 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:01:06,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:01:06,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:01:06,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:01:06,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:01:06,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:01:06,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:01:06,904 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:01:06,905 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:01:06,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:01:06,905 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:01:06,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:01:06,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:01:06,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:01:06,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:01:06,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:01:06,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:01:06,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:01:06,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:01:06,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:01:06,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:01:06,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:01:06,906 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:01:06,906 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:01:06,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:01:06,906 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 -> 5c6d968f3bfd626cfd1fff51fa64657ab37ae457da61332877d0ea5ab7fc90f2 [2024-11-07 00:01:07,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:01:07,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:01:07,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:01:07,163 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:01:07,163 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:01:07,164 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.ufo.BOUNDED-10.pals.c [2024-11-07 00:01:08,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:01:08,847 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:01:08,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.BOUNDED-10.pals.c [2024-11-07 00:01:08,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ade0bc7fd/fdbf8e7b1c954f3fb06130149a2831d9/FLAGa5a712cc2 [2024-11-07 00:01:09,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ade0bc7fd/fdbf8e7b1c954f3fb06130149a2831d9 [2024-11-07 00:01:09,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:01:09,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:01:09,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:01:09,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:01:09,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:01:09,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:01:09" (1/1) ... [2024-11-07 00:01:09,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ac3d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:09, skipping insertion in model container [2024-11-07 00:01:09,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:01:09" (1/1) ... [2024-11-07 00:01:09,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:01:09,322 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.ufo.BOUNDED-10.pals.c[14698,14711] [2024-11-07 00:01:09,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:01:09,337 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:01:09,418 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.ufo.BOUNDED-10.pals.c[14698,14711] [2024-11-07 00:01:09,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:01:09,434 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:01:09,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:09 WrapperNode [2024-11-07 00:01:09,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:01:09,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:01:09,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:01:09,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:01:09,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:09" (1/1) ... [2024-11-07 00:01:09,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:09" (1/1) ... [2024-11-07 00:01:09,485 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 510 [2024-11-07 00:01:09,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:01:09,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:01:09,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:01:09,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:01:09,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:09" (1/1) ... [2024-11-07 00:01:09,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:09" (1/1) ... [2024-11-07 00:01:09,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:09" (1/1) ... [2024-11-07 00:01:09,515 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 00:01:09,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:09" (1/1) ... [2024-11-07 00:01:09,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:09" (1/1) ... [2024-11-07 00:01:09,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:09" (1/1) ... [2024-11-07 00:01:09,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:09" (1/1) ... [2024-11-07 00:01:09,532 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:09" (1/1) ... [2024-11-07 00:01:09,534 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:09" (1/1) ... [2024-11-07 00:01:09,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:01:09,541 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:01:09,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:01:09,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:01:09,546 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:09" (1/1) ... [2024-11-07 00:01:09,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:01:09,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:09,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 00:01:09,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 00:01:09,633 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-11-07 00:01:09,633 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-11-07 00:01:09,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:01:09,633 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-11-07 00:01:09,633 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-11-07 00:01:09,633 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-07 00:01:09,633 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-07 00:01:09,633 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-11-07 00:01:09,634 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-11-07 00:01:09,634 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 00:01:09,634 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 00:01:09,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:01:09,634 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-11-07 00:01:09,634 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-11-07 00:01:09,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:01:09,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:01:09,634 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-11-07 00:01:09,634 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-11-07 00:01:09,741 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:01:09,743 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:01:10,448 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-11-07 00:01:10,448 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:01:10,469 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:01:10,469 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 00:01:10,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:01:10 BoogieIcfgContainer [2024-11-07 00:01:10,470 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:01:10,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:01:10,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:01:10,478 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:01:10,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:01:09" (1/3) ... [2024-11-07 00:01:10,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d839cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:01:10, skipping insertion in model container [2024-11-07 00:01:10,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:01:09" (2/3) ... [2024-11-07 00:01:10,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d839cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:01:10, skipping insertion in model container [2024-11-07 00:01:10,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:01:10" (3/3) ... [2024-11-07 00:01:10,482 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.ufo.BOUNDED-10.pals.c [2024-11-07 00:01:10,497 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:01:10,497 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:01:10,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:01:10,584 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;@715ec54c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:01:10,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:01:10,593 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:01:10,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 00:01:10,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:10,603 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:01:10,603 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:10,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:10,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1494571229, now seen corresponding path program 1 times [2024-11-07 00:01:10,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:10,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276726841] [2024-11-07 00:01:10,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:10,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:10,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:01:10,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:10,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276726841] [2024-11-07 00:01:10,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276726841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:10,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:10,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 00:01:10,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237798118] [2024-11-07 00:01:10,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:10,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 00:01:10,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:10,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 00:01:10,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:01:10,937 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:01:11,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:11,004 INFO L93 Difference]: Finished difference Result 346 states and 562 transitions. [2024-11-07 00:01:11,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 00:01:11,005 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:01:11,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:11,010 INFO L225 Difference]: With dead ends: 346 [2024-11-07 00:01:11,010 INFO L226 Difference]: Without dead ends: 177 [2024-11-07 00:01:11,018 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:01:11,024 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:01:11,024 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:01:11,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-07 00:01:11,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-07 00:01:11,089 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:01:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 274 transitions. [2024-11-07 00:01:11,109 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 274 transitions. Word has length 28 [2024-11-07 00:01:11,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:11,110 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 274 transitions. [2024-11-07 00:01:11,110 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:01:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 274 transitions. [2024-11-07 00:01:11,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 00:01:11,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:11,111 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:01:11,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:01:11,116 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:11,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:11,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1713425947, now seen corresponding path program 1 times [2024-11-07 00:01:11,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:11,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32616646] [2024-11-07 00:01:11,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:11,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:11,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:01:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:01:11,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:11,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32616646] [2024-11-07 00:01:11,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32616646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:11,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:11,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:01:11,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718860416] [2024-11-07 00:01:11,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:11,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:01:11,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:11,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:01:11,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:01:11,600 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:01:11,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:11,766 INFO L93 Difference]: Finished difference Result 453 states and 709 transitions. [2024-11-07 00:01:11,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:01:11,770 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:01:11,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:11,772 INFO L225 Difference]: With dead ends: 453 [2024-11-07 00:01:11,772 INFO L226 Difference]: Without dead ends: 290 [2024-11-07 00:01:11,778 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:01:11,779 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:01:11,779 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:01:11,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-07 00:01:11,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 177. [2024-11-07 00:01:11,810 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:01:11,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 262 transitions. [2024-11-07 00:01:11,818 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 262 transitions. Word has length 28 [2024-11-07 00:01:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:11,818 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 262 transitions. [2024-11-07 00:01:11,818 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:01:11,818 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 262 transitions. [2024-11-07 00:01:11,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 00:01:11,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:11,819 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:01:11,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:01:11,823 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:11,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:11,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1150379712, now seen corresponding path program 1 times [2024-11-07 00:01:11,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:11,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795230049] [2024-11-07 00:01:11,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:11,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:12,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:12,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:01:12,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:12,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795230049] [2024-11-07 00:01:12,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795230049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:12,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:12,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:12,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860746295] [2024-11-07 00:01:12,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:12,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:12,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:12,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:12,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:12,253 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:01:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:12,338 INFO L93 Difference]: Finished difference Result 341 states and 514 transitions. [2024-11-07 00:01:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:12,339 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:01:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:12,340 INFO L225 Difference]: With dead ends: 341 [2024-11-07 00:01:12,343 INFO L226 Difference]: Without dead ends: 181 [2024-11-07 00:01:12,344 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:01:12,346 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:01:12,351 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:01:12,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-07 00:01:12,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-07 00:01:12,371 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:01:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 265 transitions. [2024-11-07 00:01:12,376 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 265 transitions. Word has length 39 [2024-11-07 00:01:12,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:12,376 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 265 transitions. [2024-11-07 00:01:12,376 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:01:12,376 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 265 transitions. [2024-11-07 00:01:12,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 00:01:12,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:12,381 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:01:12,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:01:12,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:12,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:12,382 INFO L85 PathProgramCache]: Analyzing trace with hash -536779374, now seen corresponding path program 1 times [2024-11-07 00:01:12,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:12,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419516580] [2024-11-07 00:01:12,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:12,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:12,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:12,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:12,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 00:01:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:12,576 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:01:12,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:12,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419516580] [2024-11-07 00:01:12,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419516580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:12,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:12,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:01:12,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80700988] [2024-11-07 00:01:12,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:12,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:01:12,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:12,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:01:12,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:01:12,580 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:01:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:12,635 INFO L93 Difference]: Finished difference Result 497 states and 738 transitions. [2024-11-07 00:01:12,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:01:12,637 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:01:12,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:12,640 INFO L225 Difference]: With dead ends: 497 [2024-11-07 00:01:12,643 INFO L226 Difference]: Without dead ends: 333 [2024-11-07 00:01:12,644 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:01:12,644 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:01:12,645 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:01:12,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-07 00:01:12,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 327. [2024-11-07 00:01:12,664 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:01:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 485 transitions. [2024-11-07 00:01:12,667 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 485 transitions. Word has length 55 [2024-11-07 00:01:12,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:12,668 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 485 transitions. [2024-11-07 00:01:12,668 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:01:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 485 transitions. [2024-11-07 00:01:12,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:01:12,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:12,670 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:01:12,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:01:12,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:12,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:12,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1864543556, now seen corresponding path program 1 times [2024-11-07 00:01:12,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:12,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763217179] [2024-11-07 00:01:12,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:12,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:12,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:12,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:12,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 00:01:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:12,774 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:01:12,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:12,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763217179] [2024-11-07 00:01:12,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763217179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:12,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:12,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:01:12,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143404912] [2024-11-07 00:01:12,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:12,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:01:12,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:12,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:01:12,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:01:12,775 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:01:12,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:12,894 INFO L93 Difference]: Finished difference Result 920 states and 1376 transitions. [2024-11-07 00:01:12,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:01:12,895 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:01:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:12,910 INFO L225 Difference]: With dead ends: 920 [2024-11-07 00:01:12,910 INFO L226 Difference]: Without dead ends: 610 [2024-11-07 00:01:12,912 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:01:12,916 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:01:12,917 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:01:12,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-07 00:01:12,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 604. [2024-11-07 00:01:12,988 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:01:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 903 transitions. [2024-11-07 00:01:12,993 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 903 transitions. Word has length 56 [2024-11-07 00:01:12,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:12,994 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 903 transitions. [2024-11-07 00:01:12,994 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:01:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 903 transitions. [2024-11-07 00:01:12,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:01:12,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:12,996 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:01:12,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:01:12,997 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:12,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:12,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1150560062, now seen corresponding path program 1 times [2024-11-07 00:01:12,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:12,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483703763] [2024-11-07 00:01:12,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:12,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 00:01:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,152 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:01:13,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483703763] [2024-11-07 00:01:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483703763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:13,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:13,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:01:13,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649612030] [2024-11-07 00:01:13,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:13,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:01:13,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:13,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:01:13,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:13,154 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:01:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:13,336 INFO L93 Difference]: Finished difference Result 1295 states and 1932 transitions. [2024-11-07 00:01:13,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:13,337 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:01:13,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:13,342 INFO L225 Difference]: With dead ends: 1295 [2024-11-07 00:01:13,343 INFO L226 Difference]: Without dead ends: 708 [2024-11-07 00:01:13,345 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:01:13,346 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:01:13,346 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:01:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-11-07 00:01:13,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 692. [2024-11-07 00:01:13,415 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:01:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1019 transitions. [2024-11-07 00:01:13,422 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1019 transitions. Word has length 56 [2024-11-07 00:01:13,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:13,422 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 1019 transitions. [2024-11-07 00:01:13,422 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:01:13,423 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1019 transitions. [2024-11-07 00:01:13,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 00:01:13,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:13,424 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:01:13,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:01:13,424 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:13,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:13,425 INFO L85 PathProgramCache]: Analyzing trace with hash 984808241, now seen corresponding path program 1 times [2024-11-07 00:01:13,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:13,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625959706] [2024-11-07 00:01:13,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:13,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:01:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,561 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:01:13,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:13,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625959706] [2024-11-07 00:01:13,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625959706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:13,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:13,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:01:13,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906107431] [2024-11-07 00:01:13,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:13,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:01:13,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:13,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:01:13,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:01:13,563 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:01:13,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:13,734 INFO L93 Difference]: Finished difference Result 1299 states and 1932 transitions. [2024-11-07 00:01:13,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:13,739 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:01:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:13,744 INFO L225 Difference]: With dead ends: 1299 [2024-11-07 00:01:13,745 INFO L226 Difference]: Without dead ends: 712 [2024-11-07 00:01:13,747 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:01:13,748 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:01:13,748 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:01:13,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2024-11-07 00:01:13,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 700. [2024-11-07 00:01:13,821 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:01:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1027 transitions. [2024-11-07 00:01:13,827 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1027 transitions. Word has length 57 [2024-11-07 00:01:13,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:13,827 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 1027 transitions. [2024-11-07 00:01:13,828 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:01:13,828 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1027 transitions. [2024-11-07 00:01:13,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 00:01:13,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:13,829 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:01:13,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:01:13,829 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:13,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:13,830 INFO L85 PathProgramCache]: Analyzing trace with hash 461948067, now seen corresponding path program 1 times [2024-11-07 00:01:13,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:13,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354734076] [2024-11-07 00:01:13,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:13,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 00:01:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:13,970 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:01:13,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:13,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354734076] [2024-11-07 00:01:13,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354734076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:13,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:13,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:13,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447964158] [2024-11-07 00:01:13,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:13,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:13,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:13,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:13,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:13,972 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:01:14,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:14,121 INFO L93 Difference]: Finished difference Result 1287 states and 1912 transitions. [2024-11-07 00:01:14,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:14,126 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:01:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:14,131 INFO L225 Difference]: With dead ends: 1287 [2024-11-07 00:01:14,132 INFO L226 Difference]: Without dead ends: 700 [2024-11-07 00:01:14,134 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:01:14,135 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:01:14,135 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:01:14,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-07 00:01:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2024-11-07 00:01:14,205 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:01:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1023 transitions. [2024-11-07 00:01:14,211 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1023 transitions. Word has length 59 [2024-11-07 00:01:14,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:14,212 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 1023 transitions. [2024-11-07 00:01:14,212 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:01:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1023 transitions. [2024-11-07 00:01:14,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 00:01:14,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:14,213 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:01:14,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:01:14,213 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:14,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:14,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1405034612, now seen corresponding path program 1 times [2024-11-07 00:01:14,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:14,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578427023] [2024-11-07 00:01:14,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:14,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:01:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,376 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:01:14,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:14,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578427023] [2024-11-07 00:01:14,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578427023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:14,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:14,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:14,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817554433] [2024-11-07 00:01:14,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:14,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:14,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:14,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:14,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:14,378 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:01:14,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:14,467 INFO L93 Difference]: Finished difference Result 1307 states and 1936 transitions. [2024-11-07 00:01:14,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:14,468 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:01:14,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:14,473 INFO L225 Difference]: With dead ends: 1307 [2024-11-07 00:01:14,473 INFO L226 Difference]: Without dead ends: 720 [2024-11-07 00:01:14,476 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:01:14,477 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:01:14,477 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:01:14,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-11-07 00:01:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2024-11-07 00:01:14,526 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:01:14,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1039 transitions. [2024-11-07 00:01:14,533 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1039 transitions. Word has length 60 [2024-11-07 00:01:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:14,534 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1039 transitions. [2024-11-07 00:01:14,534 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:01:14,534 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1039 transitions. [2024-11-07 00:01:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 00:01:14,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:14,535 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:01:14,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:01:14,536 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:14,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:14,536 INFO L85 PathProgramCache]: Analyzing trace with hash -829990638, now seen corresponding path program 1 times [2024-11-07 00:01:14,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:14,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445430487] [2024-11-07 00:01:14,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:14,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:01:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,729 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:01:14,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:14,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445430487] [2024-11-07 00:01:14,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445430487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:14,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:14,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:14,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591426028] [2024-11-07 00:01:14,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:14,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:14,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:14,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:14,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:14,731 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:01:14,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:14,808 INFO L93 Difference]: Finished difference Result 1347 states and 1980 transitions. [2024-11-07 00:01:14,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:14,809 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:01:14,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:14,815 INFO L225 Difference]: With dead ends: 1347 [2024-11-07 00:01:14,815 INFO L226 Difference]: Without dead ends: 740 [2024-11-07 00:01:14,817 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:01:14,818 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:01:14,818 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:01:14,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2024-11-07 00:01:14,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2024-11-07 00:01:14,891 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:01:14,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1055 transitions. [2024-11-07 00:01:14,897 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1055 transitions. Word has length 68 [2024-11-07 00:01:14,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:14,897 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1055 transitions. [2024-11-07 00:01:14,897 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:01:14,898 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1055 transitions. [2024-11-07 00:01:14,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 00:01:14,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:14,899 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:01:14,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:01:14,900 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:14,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:14,900 INFO L85 PathProgramCache]: Analyzing trace with hash 102970172, now seen corresponding path program 1 times [2024-11-07 00:01:14,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:14,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084314499] [2024-11-07 00:01:14,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:14,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:15,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:15,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:15,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:01:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:15,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:15,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:01:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:15,061 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:01:15,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:15,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084314499] [2024-11-07 00:01:15,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084314499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:15,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:15,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:15,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912123436] [2024-11-07 00:01:15,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:15,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:15,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:15,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:15,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:15,063 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:01:15,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:15,129 INFO L93 Difference]: Finished difference Result 1383 states and 1996 transitions. [2024-11-07 00:01:15,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:15,130 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:01:15,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:15,136 INFO L225 Difference]: With dead ends: 1383 [2024-11-07 00:01:15,136 INFO L226 Difference]: Without dead ends: 756 [2024-11-07 00:01:15,138 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:01:15,139 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:01:15,139 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:01:15,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-11-07 00:01:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2024-11-07 00:01:15,182 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:01:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1067 transitions. [2024-11-07 00:01:15,188 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1067 transitions. Word has length 76 [2024-11-07 00:01:15,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:15,189 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1067 transitions. [2024-11-07 00:01:15,189 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:01:15,189 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1067 transitions. [2024-11-07 00:01:15,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 00:01:15,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:15,191 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:01:15,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:01:15,191 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:15,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:15,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1795537821, now seen corresponding path program 1 times [2024-11-07 00:01:15,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:15,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38861488] [2024-11-07 00:01:15,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:15,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:15,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:15,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:15,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:01:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:15,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:15,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:01:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:15,425 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:01:15,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:15,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38861488] [2024-11-07 00:01:15,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38861488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:15,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:15,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:15,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571795901] [2024-11-07 00:01:15,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:15,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:15,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:15,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:15,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:15,427 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:01:15,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:15,504 INFO L93 Difference]: Finished difference Result 1419 states and 2036 transitions. [2024-11-07 00:01:15,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:15,505 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:01:15,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:15,510 INFO L225 Difference]: With dead ends: 1419 [2024-11-07 00:01:15,511 INFO L226 Difference]: Without dead ends: 776 [2024-11-07 00:01:15,513 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:01:15,514 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:01:15,514 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:01:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-11-07 00:01:15,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2024-11-07 00:01:15,557 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:01:15,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1083 transitions. [2024-11-07 00:01:15,563 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1083 transitions. Word has length 76 [2024-11-07 00:01:15,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:15,563 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1083 transitions. [2024-11-07 00:01:15,564 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:01:15,564 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1083 transitions. [2024-11-07 00:01:15,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 00:01:15,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:15,566 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:01:15,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:01:15,566 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:15,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:15,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1351818595, now seen corresponding path program 1 times [2024-11-07 00:01:15,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:15,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055294007] [2024-11-07 00:01:15,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:15,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:15,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:15,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:15,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:01:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:15,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:15,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:01:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:15,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:01:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:15,786 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:01:15,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:15,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055294007] [2024-11-07 00:01:15,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055294007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:15,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:15,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:15,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408412739] [2024-11-07 00:01:15,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:15,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:15,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:15,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:15,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:15,788 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:01:15,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:15,860 INFO L93 Difference]: Finished difference Result 1463 states and 2064 transitions. [2024-11-07 00:01:15,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:15,861 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:01:15,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:15,867 INFO L225 Difference]: With dead ends: 1463 [2024-11-07 00:01:15,868 INFO L226 Difference]: Without dead ends: 800 [2024-11-07 00:01:15,870 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:01:15,871 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:01:15,871 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:01:15,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-07 00:01:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2024-11-07 00:01:15,916 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:01:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1103 transitions. [2024-11-07 00:01:15,923 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1103 transitions. Word has length 84 [2024-11-07 00:01:15,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:15,924 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1103 transitions. [2024-11-07 00:01:15,924 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:01:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1103 transitions. [2024-11-07 00:01:15,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 00:01:15,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:15,926 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:01:15,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:01:15,927 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:15,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:15,927 INFO L85 PathProgramCache]: Analyzing trace with hash 938140804, now seen corresponding path program 1 times [2024-11-07 00:01:15,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:15,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137220924] [2024-11-07 00:01:15,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:15,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:16,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:16,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:16,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:01:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:16,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:16,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:01:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:16,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:01:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:16,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 00:01:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:16,674 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:01:16,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:16,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137220924] [2024-11-07 00:01:16,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137220924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:16,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:16,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:01:16,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113710545] [2024-11-07 00:01:16,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:16,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:01:16,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:16,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:01:16,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:01:16,676 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:01:17,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:17,214 INFO L93 Difference]: Finished difference Result 2059 states and 2829 transitions. [2024-11-07 00:01:17,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:01:17,215 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:01:17,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:17,228 INFO L225 Difference]: With dead ends: 2059 [2024-11-07 00:01:17,229 INFO L226 Difference]: Without dead ends: 1372 [2024-11-07 00:01:17,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:01:17,232 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 197 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:17,232 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.3s Time] [2024-11-07 00:01:17,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2024-11-07 00:01:17,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1084. [2024-11-07 00:01:17,343 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:01:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1481 transitions. [2024-11-07 00:01:17,354 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1481 transitions. Word has length 87 [2024-11-07 00:01:17,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:17,355 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1481 transitions. [2024-11-07 00:01:17,355 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:01:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1481 transitions. [2024-11-07 00:01:17,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 00:01:17,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:17,356 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:01:17,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:01:17,356 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:17,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:17,356 INFO L85 PathProgramCache]: Analyzing trace with hash -262931398, now seen corresponding path program 1 times [2024-11-07 00:01:17,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:17,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593015065] [2024-11-07 00:01:17,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:17,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:17,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:17,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:17,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:01:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:17,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:17,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:01:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:17,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:01:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:17,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 00:01:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:17,567 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:01:17,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:17,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593015065] [2024-11-07 00:01:17,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593015065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:17,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:17,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:17,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481136910] [2024-11-07 00:01:17,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:17,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:17,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:17,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:17,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:17,568 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:01:17,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:17,691 INFO L93 Difference]: Finished difference Result 2011 states and 2772 transitions. [2024-11-07 00:01:17,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:17,694 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:01:17,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:17,703 INFO L225 Difference]: With dead ends: 2011 [2024-11-07 00:01:17,703 INFO L226 Difference]: Without dead ends: 1108 [2024-11-07 00:01:17,705 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:01:17,709 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:01:17,710 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:01:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2024-11-07 00:01:17,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2024-11-07 00:01:17,810 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:01:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1499 transitions. [2024-11-07 00:01:17,822 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1499 transitions. Word has length 91 [2024-11-07 00:01:17,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:17,822 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1499 transitions. [2024-11-07 00:01:17,822 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:01:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1499 transitions. [2024-11-07 00:01:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 00:01:17,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:17,823 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:01:17,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:01:17,824 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:17,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:17,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1171844932, now seen corresponding path program 1 times [2024-11-07 00:01:17,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:17,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376578874] [2024-11-07 00:01:17,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:17,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:01:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:01:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:01:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 00:01:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,229 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:01:18,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:18,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376578874] [2024-11-07 00:01:18,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376578874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:18,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:18,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:01:18,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847058054] [2024-11-07 00:01:18,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:18,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:01:18,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:18,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:01:18,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:01:18,231 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:01:18,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:18,391 INFO L93 Difference]: Finished difference Result 1540 states and 2191 transitions. [2024-11-07 00:01:18,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:01:18,391 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:01:18,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:18,400 INFO L225 Difference]: With dead ends: 1540 [2024-11-07 00:01:18,400 INFO L226 Difference]: Without dead ends: 1538 [2024-11-07 00:01:18,402 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:01:18,402 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:01:18,403 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:01:18,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2024-11-07 00:01:18,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1116. [2024-11-07 00:01:18,480 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:01:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1507 transitions. [2024-11-07 00:01:18,487 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1507 transitions. Word has length 90 [2024-11-07 00:01:18,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:18,487 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1507 transitions. [2024-11-07 00:01:18,487 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:01:18,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1507 transitions. [2024-11-07 00:01:18,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 00:01:18,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:18,489 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:01:18,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:01:18,490 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:18,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:18,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1049695796, now seen corresponding path program 1 times [2024-11-07 00:01:18,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:18,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632701744] [2024-11-07 00:01:18,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:18,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:01:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:01:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:01:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 00:01:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:18,640 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:01:18,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:18,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632701744] [2024-11-07 00:01:18,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632701744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:18,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:18,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:01:18,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90231505] [2024-11-07 00:01:18,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:18,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:01:18,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:18,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:01:18,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:01:18,642 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:01:18,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:18,832 INFO L93 Difference]: Finished difference Result 2016 states and 2732 transitions. [2024-11-07 00:01:18,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:01:18,833 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:01:18,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:18,841 INFO L225 Difference]: With dead ends: 2016 [2024-11-07 00:01:18,841 INFO L226 Difference]: Without dead ends: 1163 [2024-11-07 00:01:18,844 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:01:18,845 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:01:18,845 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:01:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2024-11-07 00:01:18,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1121. [2024-11-07 00:01:18,947 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:01:18,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1496 transitions. [2024-11-07 00:01:18,954 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1496 transitions. Word has length 93 [2024-11-07 00:01:18,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:18,954 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1496 transitions. [2024-11-07 00:01:18,954 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:01:18,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1496 transitions. [2024-11-07 00:01:18,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 00:01:18,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:18,956 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:01:18,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:01:18,956 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:18,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:18,957 INFO L85 PathProgramCache]: Analyzing trace with hash 82901354, now seen corresponding path program 1 times [2024-11-07 00:01:18,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:18,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649848210] [2024-11-07 00:01:18,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:18,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:01:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:01:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:01:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 00:01:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 00:01:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,471 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:01:19,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:19,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649848210] [2024-11-07 00:01:19,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649848210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:19,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:19,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:01:19,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812710109] [2024-11-07 00:01:19,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:19,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:01:19,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:19,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:01:19,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:01:19,473 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:01:19,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:19,734 INFO L93 Difference]: Finished difference Result 1997 states and 2677 transitions. [2024-11-07 00:01:19,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:01:19,735 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:01:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:19,742 INFO L225 Difference]: With dead ends: 1997 [2024-11-07 00:01:19,743 INFO L226 Difference]: Without dead ends: 1119 [2024-11-07 00:01:19,746 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:01:19,747 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:01:19,747 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:01:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2024-11-07 00:01:19,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1011. [2024-11-07 00:01:19,827 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:01:19,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1352 transitions. [2024-11-07 00:01:19,836 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1352 transitions. Word has length 95 [2024-11-07 00:01:19,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:19,836 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1352 transitions. [2024-11-07 00:01:19,837 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:01:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1352 transitions. [2024-11-07 00:01:19,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:01:19,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:19,838 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:01:19,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:01:19,839 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:19,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:19,839 INFO L85 PathProgramCache]: Analyzing trace with hash -914641030, now seen corresponding path program 1 times [2024-11-07 00:01:19,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:19,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228051017] [2024-11-07 00:01:19,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:19,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:20,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:20,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:20,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:01:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:20,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:20,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:01:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:20,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:01:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:20,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 00:01:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:20,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 00:01:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:20,354 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:01:20,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:20,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228051017] [2024-11-07 00:01:20,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228051017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:20,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:20,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:01:20,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172781534] [2024-11-07 00:01:20,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:20,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:01:20,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:20,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:01:20,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:01:20,356 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:01:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:20,809 INFO L93 Difference]: Finished difference Result 1941 states and 2593 transitions. [2024-11-07 00:01:20,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:01:20,809 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:01:20,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:20,817 INFO L225 Difference]: With dead ends: 1941 [2024-11-07 00:01:20,817 INFO L226 Difference]: Without dead ends: 1103 [2024-11-07 00:01:20,819 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:01:20,820 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 521 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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:01:20,820 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:01:20,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2024-11-07 00:01:20,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1049. [2024-11-07 00:01:20,893 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:01:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1384 transitions. [2024-11-07 00:01:20,899 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1384 transitions. Word has length 96 [2024-11-07 00:01:20,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:20,900 INFO L471 AbstractCegarLoop]: Abstraction has 1049 states and 1384 transitions. [2024-11-07 00:01:20,900 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:01:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1384 transitions. [2024-11-07 00:01:20,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 00:01:20,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:20,902 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:01:20,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:01:20,902 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:20,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:20,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1015746611, now seen corresponding path program 1 times [2024-11-07 00:01:20,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:20,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571631587] [2024-11-07 00:01:20,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:20,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:21,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:21,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:01:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:21,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:01:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:21,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 00:01:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:21,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 00:01:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:21,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:01:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:21,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:01:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:21,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 00:01:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:21,415 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:01:21,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:21,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571631587] [2024-11-07 00:01:21,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571631587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:21,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:21,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:01:21,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341117862] [2024-11-07 00:01:21,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:21,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:01:21,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:21,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:01:21,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:01:21,418 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:01:21,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:21,859 INFO L93 Difference]: Finished difference Result 2028 states and 2661 transitions. [2024-11-07 00:01:21,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:01:21,859 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:01:21,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:21,868 INFO L225 Difference]: With dead ends: 2028 [2024-11-07 00:01:21,868 INFO L226 Difference]: Without dead ends: 1165 [2024-11-07 00:01:21,871 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:01:21,874 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:01:21,874 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:01:21,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2024-11-07 00:01:21,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1071. [2024-11-07 00:01:21,967 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:01:21,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1396 transitions. [2024-11-07 00:01:21,973 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1396 transitions. Word has length 98 [2024-11-07 00:01:21,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:21,973 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1396 transitions. [2024-11-07 00:01:21,974 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:01:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1396 transitions. [2024-11-07 00:01:21,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:01:21,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:21,976 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:01:21,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 00:01:21,976 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:21,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:21,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1023582542, now seen corresponding path program 1 times [2024-11-07 00:01:21,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:21,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419057548] [2024-11-07 00:01:21,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:21,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 00:01:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:01:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 00:01:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 00:01:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 00:01:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 00:01:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,092 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:22,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:22,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419057548] [2024-11-07 00:01:22,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419057548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:22,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:22,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:22,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546371821] [2024-11-07 00:01:22,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:22,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:22,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:22,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:22,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:22,095 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:01:22,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:22,338 INFO L93 Difference]: Finished difference Result 2787 states and 3662 transitions. [2024-11-07 00:01:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:22,339 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:01:22,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:22,350 INFO L225 Difference]: With dead ends: 2787 [2024-11-07 00:01:22,350 INFO L226 Difference]: Without dead ends: 1980 [2024-11-07 00:01:22,353 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:01:22,355 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.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:22,355 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.1s Time] [2024-11-07 00:01:22,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2024-11-07 00:01:22,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1797. [2024-11-07 00:01:22,515 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:01:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2354 transitions. [2024-11-07 00:01:22,525 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2354 transitions. Word has length 99 [2024-11-07 00:01:22,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:22,525 INFO L471 AbstractCegarLoop]: Abstraction has 1797 states and 2354 transitions. [2024-11-07 00:01:22,525 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:01:22,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2354 transitions. [2024-11-07 00:01:22,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:01:22,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:22,527 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:01:22,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 00:01:22,528 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:22,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:22,528 INFO L85 PathProgramCache]: Analyzing trace with hash 506581735, now seen corresponding path program 1 times [2024-11-07 00:01:22,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:22,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151457758] [2024-11-07 00:01:22,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:22,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 00:01:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:01:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 00:01:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 00:01:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 00:01:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 00:01:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:22,677 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:22,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:22,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151457758] [2024-11-07 00:01:22,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151457758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:22,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:22,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:22,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125723319] [2024-11-07 00:01:22,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:22,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:22,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:22,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:22,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:22,680 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:01:23,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:23,070 INFO L93 Difference]: Finished difference Result 4559 states and 6008 transitions. [2024-11-07 00:01:23,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:23,072 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:01:23,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:23,107 INFO L225 Difference]: With dead ends: 4559 [2024-11-07 00:01:23,108 INFO L226 Difference]: Without dead ends: 3099 [2024-11-07 00:01:23,118 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:01:23,121 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:01:23,121 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:01:23,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2024-11-07 00:01:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 2818. [2024-11-07 00:01:23,333 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:01:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 3681 transitions. [2024-11-07 00:01:23,348 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 3681 transitions. Word has length 101 [2024-11-07 00:01:23,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:23,349 INFO L471 AbstractCegarLoop]: Abstraction has 2818 states and 3681 transitions. [2024-11-07 00:01:23,349 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:23,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 3681 transitions. [2024-11-07 00:01:23,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:01:23,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:23,352 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:01:23,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 00:01:23,352 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:23,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:23,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1826960265, now seen corresponding path program 1 times [2024-11-07 00:01:23,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:23,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969661578] [2024-11-07 00:01:23,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:23,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:01:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 00:01:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 00:01:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 00:01:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 00:01:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:01:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,441 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:23,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:23,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969661578] [2024-11-07 00:01:23,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969661578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:23,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:23,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:23,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390571894] [2024-11-07 00:01:23,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:23,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:23,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:23,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:23,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:23,442 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:01:23,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:23,718 INFO L93 Difference]: Finished difference Result 6581 states and 8639 transitions. [2024-11-07 00:01:23,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:23,719 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:01:23,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:23,736 INFO L225 Difference]: With dead ends: 6581 [2024-11-07 00:01:23,736 INFO L226 Difference]: Without dead ends: 4220 [2024-11-07 00:01:23,741 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:01:23,742 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.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:23,742 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.0s Time] [2024-11-07 00:01:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4220 states. [2024-11-07 00:01:23,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4220 to 4035. [2024-11-07 00:01:24,006 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:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4035 states to 4035 states and 5266 transitions. [2024-11-07 00:01:24,021 INFO L78 Accepts]: Start accepts. Automaton has 4035 states and 5266 transitions. Word has length 101 [2024-11-07 00:01:24,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:24,021 INFO L471 AbstractCegarLoop]: Abstraction has 4035 states and 5266 transitions. [2024-11-07 00:01:24,021 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:24,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4035 states and 5266 transitions. [2024-11-07 00:01:24,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 00:01:24,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:24,023 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:24,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 00:01:24,023 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:24,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:24,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1131002330, now seen corresponding path program 1 times [2024-11-07 00:01:24,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:24,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808317887] [2024-11-07 00:01:24,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:24,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 00:01:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:01:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 00:01:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:01:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 00:01:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 00:01:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 00:01:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,086 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:24,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:24,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808317887] [2024-11-07 00:01:24,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808317887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:24,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:24,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:01:24,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603141469] [2024-11-07 00:01:24,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:24,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:01:24,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:24,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:01:24,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:01:24,088 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:24,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:24,364 INFO L93 Difference]: Finished difference Result 7749 states and 10163 transitions. [2024-11-07 00:01:24,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:01:24,364 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:24,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:24,388 INFO L225 Difference]: With dead ends: 7749 [2024-11-07 00:01:24,388 INFO L226 Difference]: Without dead ends: 4068 [2024-11-07 00:01:24,394 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:24,395 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:24,395 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:24,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4068 states. [2024-11-07 00:01:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4068 to 4041. [2024-11-07 00:01:24,660 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:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4041 states to 4041 states and 5272 transitions. [2024-11-07 00:01:24,675 INFO L78 Accepts]: Start accepts. Automaton has 4041 states and 5272 transitions. Word has length 102 [2024-11-07 00:01:24,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:24,675 INFO L471 AbstractCegarLoop]: Abstraction has 4041 states and 5272 transitions. [2024-11-07 00:01:24,676 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:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand 4041 states and 5272 transitions. [2024-11-07 00:01:24,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 00:01:24,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:24,679 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:24,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 00:01:24,679 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:24,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:24,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1347241870, now seen corresponding path program 1 times [2024-11-07 00:01:24,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:24,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448551988] [2024-11-07 00:01:24,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:24,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:01:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 00:01:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 00:01:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 00:01:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 00:01:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:01:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:24,804 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:24,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:24,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448551988] [2024-11-07 00:01:24,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448551988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:24,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:24,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:24,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462577412] [2024-11-07 00:01:24,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:24,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:24,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:24,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:24,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:24,806 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:25,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:25,137 INFO L93 Difference]: Finished difference Result 7714 states and 10090 transitions. [2024-11-07 00:01:25,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:25,138 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:25,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:25,163 INFO L225 Difference]: With dead ends: 7714 [2024-11-07 00:01:25,164 INFO L226 Difference]: Without dead ends: 3749 [2024-11-07 00:01:25,174 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:25,175 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:25,175 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:25,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3749 states. [2024-11-07 00:01:25,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3749 to 3686. [2024-11-07 00:01:25,462 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:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 4840 transitions. [2024-11-07 00:01:25,475 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 4840 transitions. Word has length 103 [2024-11-07 00:01:25,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:25,476 INFO L471 AbstractCegarLoop]: Abstraction has 3686 states and 4840 transitions. [2024-11-07 00:01:25,476 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:25,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 4840 transitions. [2024-11-07 00:01:25,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 00:01:25,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:25,477 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:25,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 00:01:25,478 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:25,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:25,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2076713750, now seen corresponding path program 1 times [2024-11-07 00:01:25,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:25,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305978100] [2024-11-07 00:01:25,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:25,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 00:01:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:01:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 00:01:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:01:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 00:01:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 00:01:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 00:01:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,532 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:25,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:25,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305978100] [2024-11-07 00:01:25,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305978100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:25,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:25,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:01:25,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537209095] [2024-11-07 00:01:25,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:25,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:01:25,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:25,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:01:25,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:01:25,533 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:25,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:25,783 INFO L93 Difference]: Finished difference Result 7242 states and 9550 transitions. [2024-11-07 00:01:25,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:01:25,784 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:25,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:25,798 INFO L225 Difference]: With dead ends: 7242 [2024-11-07 00:01:25,799 INFO L226 Difference]: Without dead ends: 3737 [2024-11-07 00:01:25,807 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:25,807 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 6 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 489 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:25,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 489 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:25,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2024-11-07 00:01:25,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 3696. [2024-11-07 00:01:25,996 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:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 4850 transitions. [2024-11-07 00:01:26,011 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 4850 transitions. Word has length 104 [2024-11-07 00:01:26,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:26,011 INFO L471 AbstractCegarLoop]: Abstraction has 3696 states and 4850 transitions. [2024-11-07 00:01:26,011 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:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 4850 transitions. [2024-11-07 00:01:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 00:01:26,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:26,013 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:26,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 00:01:26,014 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:26,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:26,015 INFO L85 PathProgramCache]: Analyzing trace with hash -2022352177, now seen corresponding path program 1 times [2024-11-07 00:01:26,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:26,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461578382] [2024-11-07 00:01:26,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:26,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 00:01:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:01:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 00:01:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:01:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 00:01:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 00:01:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 00:01:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,110 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:26,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:26,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461578382] [2024-11-07 00:01:26,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461578382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:26,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:26,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:26,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951597509] [2024-11-07 00:01:26,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:26,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:26,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:26,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:26,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:26,113 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:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:26,324 INFO L93 Difference]: Finished difference Result 7193 states and 9461 transitions. [2024-11-07 00:01:26,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:26,324 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:26,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:26,337 INFO L225 Difference]: With dead ends: 7193 [2024-11-07 00:01:26,337 INFO L226 Difference]: Without dead ends: 3616 [2024-11-07 00:01:26,343 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:26,344 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:26,344 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:26,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3616 states. [2024-11-07 00:01:26,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3616 to 2785. [2024-11-07 00:01:26,532 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:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 3646 transitions. [2024-11-07 00:01:26,545 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 3646 transitions. Word has length 104 [2024-11-07 00:01:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:26,546 INFO L471 AbstractCegarLoop]: Abstraction has 2785 states and 3646 transitions. [2024-11-07 00:01:26,546 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:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 3646 transitions. [2024-11-07 00:01:26,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-07 00:01:26,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:26,551 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:26,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 00:01:26,551 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:26,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:26,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1445089110, now seen corresponding path program 1 times [2024-11-07 00:01:26,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:26,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097007397] [2024-11-07 00:01:26,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:26,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:01:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:01:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:01:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 00:01:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 00:01:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 00:01:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 00:01:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 00:01:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 00:01:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 00:01:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 00:01:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,785 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:26,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:26,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097007397] [2024-11-07 00:01:26,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097007397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:26,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372948265] [2024-11-07 00:01:26,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:26,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:26,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:26,788 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:26,789 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:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 00:01:26,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:27,046 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:27,047 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:27,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372948265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:27,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:27,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-11-07 00:01:27,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287453997] [2024-11-07 00:01:27,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:27,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:01:27,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:27,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:01:27,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 00:01:27,049 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:27,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:27,240 INFO L93 Difference]: Finished difference Result 5240 states and 6902 transitions. [2024-11-07 00:01:27,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:27,241 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:27,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:27,252 INFO L225 Difference]: With dead ends: 5240 [2024-11-07 00:01:27,252 INFO L226 Difference]: Without dead ends: 2614 [2024-11-07 00:01:27,256 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:27,257 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:27,258 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:27,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2614 states. [2024-11-07 00:01:27,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2614 to 2598. [2024-11-07 00:01:27,394 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:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 3395 transitions. [2024-11-07 00:01:27,402 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 3395 transitions. Word has length 154 [2024-11-07 00:01:27,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:27,402 INFO L471 AbstractCegarLoop]: Abstraction has 2598 states and 3395 transitions. [2024-11-07 00:01:27,403 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:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3395 transitions. [2024-11-07 00:01:27,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 00:01:27,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:27,406 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:27,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 00:01:27,607 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:27,607 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:27,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:27,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1661978996, now seen corresponding path program 1 times [2024-11-07 00:01:27,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:27,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547627068] [2024-11-07 00:01:27,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:27,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:01:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 00:01:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:01:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:01:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 00:01:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:01:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:01:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 00:01:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 00:01:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:01:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 00:01:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 00:01:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 00:01:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,080 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:28,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:28,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547627068] [2024-11-07 00:01:28,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547627068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:28,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155646234] [2024-11-07 00:01:28,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:28,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:28,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:28,086 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:28,094 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:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:28,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 00:01:28,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:28,607 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:28,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:28,923 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:28,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155646234] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:28,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:28,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 24 [2024-11-07 00:01:28,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821878705] [2024-11-07 00:01:28,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:28,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 00:01:28,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:28,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 00:01:28,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-11-07 00:01:28,926 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:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:34,874 INFO L93 Difference]: Finished difference Result 7606 states and 9971 transitions. [2024-11-07 00:01:34,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-07 00:01:34,874 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:34,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:34,895 INFO L225 Difference]: With dead ends: 7606 [2024-11-07 00:01:34,895 INFO L226 Difference]: Without dead ends: 5234 [2024-11-07 00:01:34,904 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:34,904 INFO L432 NwaCegarLoop]: 656 mSDtfsCounter, 2496 mSDsluCounter, 7615 mSDsCounter, 0 mSdLazyCounter, 3945 mSolverCounterSat, 894 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2496 SdHoareTripleChecker+Valid, 8271 SdHoareTripleChecker+Invalid, 4839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 894 IncrementalHoareTripleChecker+Valid, 3945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:34,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2496 Valid, 8271 Invalid, 4839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [894 Valid, 3945 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-07 00:01:34,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5234 states. [2024-11-07 00:01:35,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5234 to 4543. [2024-11-07 00:01:35,352 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:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4543 states to 4543 states and 5936 transitions. [2024-11-07 00:01:35,367 INFO L78 Accepts]: Start accepts. Automaton has 4543 states and 5936 transitions. Word has length 156 [2024-11-07 00:01:35,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:35,368 INFO L471 AbstractCegarLoop]: Abstraction has 4543 states and 5936 transitions. [2024-11-07 00:01:35,368 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:35,368 INFO L276 IsEmpty]: Start isEmpty. Operand 4543 states and 5936 transitions. [2024-11-07 00:01:35,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 00:01:35,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:35,374 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:35,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 00:01:35,574 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:35,575 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:35,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:35,575 INFO L85 PathProgramCache]: Analyzing trace with hash -554573914, now seen corresponding path program 1 times [2024-11-07 00:01:35,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:35,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920525116] [2024-11-07 00:01:35,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:35,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:01:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:01:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 00:01:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 00:01:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:01:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 00:01:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 00:01:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 00:01:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 00:01:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 00:01:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 00:01:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 00:01:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 00:01:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:35,847 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:35,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:35,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920525116] [2024-11-07 00:01:35,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920525116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:35,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86109486] [2024-11-07 00:01:35,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:35,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:35,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:35,856 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:35,860 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:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:36,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-07 00:01:36,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:36,710 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:36,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:37,270 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:37,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86109486] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:37,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:37,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 22 [2024-11-07 00:01:37,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704104167] [2024-11-07 00:01:37,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:37,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 00:01:37,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:37,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 00:01:37,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2024-11-07 00:01:37,273 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:40,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:40,178 INFO L93 Difference]: Finished difference Result 10758 states and 14046 transitions. [2024-11-07 00:01:40,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-07 00:01:40,180 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:40,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:40,237 INFO L225 Difference]: With dead ends: 10758 [2024-11-07 00:01:40,241 INFO L226 Difference]: Without dead ends: 6460 [2024-11-07 00:01:40,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=881, Invalid=2541, Unknown=0, NotChecked=0, Total=3422 [2024-11-07 00:01:40,265 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 3073 mSDsluCounter, 2355 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 1093 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3073 SdHoareTripleChecker+Valid, 2678 SdHoareTripleChecker+Invalid, 2442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1093 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:40,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3073 Valid, 2678 Invalid, 2442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1093 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 00:01:40,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2024-11-07 00:01:41,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 6130. [2024-11-07 00:01:41,212 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:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6130 states to 6130 states and 7959 transitions. [2024-11-07 00:01:41,235 INFO L78 Accepts]: Start accepts. Automaton has 6130 states and 7959 transitions. Word has length 157 [2024-11-07 00:01:41,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:41,237 INFO L471 AbstractCegarLoop]: Abstraction has 6130 states and 7959 transitions. [2024-11-07 00:01:41,238 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:41,239 INFO L276 IsEmpty]: Start isEmpty. Operand 6130 states and 7959 transitions. [2024-11-07 00:01:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 00:01:41,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:41,248 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:41,273 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:41,449 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:41,450 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:41,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:41,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2129400353, now seen corresponding path program 1 times [2024-11-07 00:01:41,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:41,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142338346] [2024-11-07 00:01:41,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:41,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:01:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:01:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 00:01:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 00:01:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:01:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 00:01:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 00:01:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 00:01:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 00:01:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:01:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 00:01:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:01:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 00:01:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:41,706 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:41,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:41,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142338346] [2024-11-07 00:01:41,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142338346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:41,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:41,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:01:41,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839650269] [2024-11-07 00:01:41,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:41,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:01:41,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:41,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:01:41,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:01:41,709 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:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:43,147 INFO L93 Difference]: Finished difference Result 17980 states and 23407 transitions. [2024-11-07 00:01:43,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:01:43,148 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:43,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:43,231 INFO L225 Difference]: With dead ends: 17980 [2024-11-07 00:01:43,231 INFO L226 Difference]: Without dead ends: 12155 [2024-11-07 00:01:43,264 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:43,265 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 224 mSDsluCounter, 2097 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:43,267 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.2s Time] [2024-11-07 00:01:43,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12155 states. [2024-11-07 00:01:44,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12155 to 8614. [2024-11-07 00:01:44,276 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:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8614 states to 8614 states and 11208 transitions. [2024-11-07 00:01:44,304 INFO L78 Accepts]: Start accepts. Automaton has 8614 states and 11208 transitions. Word has length 159 [2024-11-07 00:01:44,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:44,305 INFO L471 AbstractCegarLoop]: Abstraction has 8614 states and 11208 transitions. [2024-11-07 00:01:44,305 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:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 8614 states and 11208 transitions. [2024-11-07 00:01:44,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 00:01:44,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:44,317 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:44,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 00:01:44,317 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:44,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:44,317 INFO L85 PathProgramCache]: Analyzing trace with hash 713092917, now seen corresponding path program 1 times [2024-11-07 00:01:44,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:44,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209207494] [2024-11-07 00:01:44,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:44,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 00:01:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:01:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 00:01:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 00:01:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 00:01:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 00:01:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 00:01:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 00:01:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:01:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 00:01:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:01:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 00:01:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:44,967 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:44,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:44,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209207494] [2024-11-07 00:01:44,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209207494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:44,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284923502] [2024-11-07 00:01:44,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:44,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:44,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:44,971 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:44,979 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:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:45,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-07 00:01:45,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:45,540 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:45,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:46,381 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:46,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284923502] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:46,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:46,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 10] total 27 [2024-11-07 00:01:46,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671520551] [2024-11-07 00:01:46,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:46,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 00:01:46,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:46,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 00:01:46,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2024-11-07 00:01:46,385 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:49,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:49,052 INFO L93 Difference]: Finished difference Result 17707 states and 23104 transitions. [2024-11-07 00:01:49,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 00:01:49,052 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:49,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:49,097 INFO L225 Difference]: With dead ends: 17707 [2024-11-07 00:01:49,098 INFO L226 Difference]: Without dead ends: 9386 [2024-11-07 00:01:49,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=315, Invalid=1491, Unknown=0, NotChecked=0, Total=1806 [2024-11-07 00:01:49,118 INFO L432 NwaCegarLoop]: 465 mSDtfsCounter, 759 mSDsluCounter, 3981 mSDsCounter, 0 mSdLazyCounter, 2459 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 4446 SdHoareTripleChecker+Invalid, 2624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 2459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:49,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 4446 Invalid, 2624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 2459 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 00:01:49,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9386 states. [2024-11-07 00:01:50,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9386 to 9096. [2024-11-07 00:01:50,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9096 states, 6683 states have (on average 1.299566063145294) internal successors, (8685), 6745 states have internal predecessors, (8685), 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:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9096 states to 9096 states and 11821 transitions. [2024-11-07 00:01:50,326 INFO L78 Accepts]: Start accepts. Automaton has 9096 states and 11821 transitions. Word has length 159 [2024-11-07 00:01:50,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:50,326 INFO L471 AbstractCegarLoop]: Abstraction has 9096 states and 11821 transitions. [2024-11-07 00:01:50,326 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:50,327 INFO L276 IsEmpty]: Start isEmpty. Operand 9096 states and 11821 transitions. [2024-11-07 00:01:50,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 00:01:50,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:50,336 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:50,351 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:50,536 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:50,537 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:50,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:50,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2096956834, now seen corresponding path program 1 times [2024-11-07 00:01:50,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:50,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752813561] [2024-11-07 00:01:50,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:50,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:51,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:51,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:51,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 00:01:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:51,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:01:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:51,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 00:01:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:51,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 00:01:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:51,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 00:01:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:51,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 00:01:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:51,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 00:01:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:51,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 00:01:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:51,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 00:01:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:51,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:01:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:51,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 00:01:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:51,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 00:01:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:51,361 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:51,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:51,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752813561] [2024-11-07 00:01:51,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752813561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:51,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039881330] [2024-11-07 00:01:51,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:51,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:51,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:51,382 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:51,383 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:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:51,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 00:01:51,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:52,228 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:52,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:52,803 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:52,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039881330] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:52,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:52,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 24 [2024-11-07 00:01:52,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557401562] [2024-11-07 00:01:52,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:52,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 00:01:52,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:52,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 00:01:52,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2024-11-07 00:01:52,807 INFO L87 Difference]: Start difference. First operand 9096 states and 11821 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:56,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:56,993 INFO L93 Difference]: Finished difference Result 22917 states and 29812 transitions. [2024-11-07 00:01:56,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-07 00:01:56,994 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:56,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:57,067 INFO L225 Difference]: With dead ends: 22917 [2024-11-07 00:01:57,068 INFO L226 Difference]: Without dead ends: 14070 [2024-11-07 00:01:57,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=843, Invalid=3317, Unknown=0, NotChecked=0, Total=4160 [2024-11-07 00:01:57,092 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 2573 mSDsluCounter, 3751 mSDsCounter, 0 mSdLazyCounter, 2465 mSolverCounterSat, 817 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2573 SdHoareTripleChecker+Valid, 4228 SdHoareTripleChecker+Invalid, 3282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 817 IncrementalHoareTripleChecker+Valid, 2465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:57,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2573 Valid, 4228 Invalid, 3282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [817 Valid, 2465 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 00:01:57,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14070 states. [2024-11-07 00:01:59,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14070 to 12959. [2024-11-07 00:01:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12959 states, 9498 states have (on average 1.300905453779743) internal successors, (12356), 9592 states have internal predecessors, (12356), 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:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12959 states to 12959 states and 16858 transitions. [2024-11-07 00:01:59,426 INFO L78 Accepts]: Start accepts. Automaton has 12959 states and 16858 transitions. Word has length 160 [2024-11-07 00:01:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:59,430 INFO L471 AbstractCegarLoop]: Abstraction has 12959 states and 16858 transitions. [2024-11-07 00:01:59,431 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:59,431 INFO L276 IsEmpty]: Start isEmpty. Operand 12959 states and 16858 transitions. [2024-11-07 00:01:59,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-07 00:01:59,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:59,446 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:59,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 00:01:59,647 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:59,647 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:59,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:59,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1293554788, now seen corresponding path program 1 times [2024-11-07 00:01:59,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:59,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098997111] [2024-11-07 00:01:59,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:59,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:02:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:02:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:02:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 00:02:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 00:02:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:02:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 00:02:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 00:02:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 00:02:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:02:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 00:02:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 00:02:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:02:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 00:02:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,070 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:02:00,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:00,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098997111] [2024-11-07 00:02:00,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098997111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:02:00,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497348563] [2024-11-07 00:02:00,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:00,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:02:00,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:02:00,078 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:02:00,082 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:02:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:00,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 00:02:00,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:02:00,658 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:02:00,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:02:00,987 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:02:00,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497348563] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:02:00,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:02:00,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 22 [2024-11-07 00:02:00,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405579125] [2024-11-07 00:02:00,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:02:00,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 00:02:00,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:00,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 00:02:00,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2024-11-07 00:02:00,989 INFO L87 Difference]: Start difference. First operand 12959 states and 16858 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:02:06,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:06,999 INFO L93 Difference]: Finished difference Result 32877 states and 42894 transitions. [2024-11-07 00:02:06,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-11-07 00:02:07,000 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:02:07,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:07,071 INFO L225 Difference]: With dead ends: 32877 [2024-11-07 00:02:07,071 INFO L226 Difference]: Without dead ends: 20191 [2024-11-07 00:02:07,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7826 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2712, Invalid=18168, Unknown=0, NotChecked=0, Total=20880 [2024-11-07 00:02:07,102 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 3059 mSDsluCounter, 3591 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 915 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3059 SdHoareTripleChecker+Valid, 3966 SdHoareTripleChecker+Invalid, 3090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 915 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:02:07,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3059 Valid, 3966 Invalid, 3090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [915 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 00:02:07,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20191 states. [2024-11-07 00:02:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20191 to 19036. [2024-11-07 00:02:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19036 states, 14047 states have (on average 1.3009183455542108) internal successors, (18274), 14178 states have internal predecessors, (18274), 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:02:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19036 states to 19036 states and 24724 transitions. [2024-11-07 00:02:10,300 INFO L78 Accepts]: Start accepts. Automaton has 19036 states and 24724 transitions. Word has length 161 [2024-11-07 00:02:10,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:10,301 INFO L471 AbstractCegarLoop]: Abstraction has 19036 states and 24724 transitions. [2024-11-07 00:02:10,301 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:02:10,301 INFO L276 IsEmpty]: Start isEmpty. Operand 19036 states and 24724 transitions. [2024-11-07 00:02:10,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-07 00:02:10,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:10,313 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:02:10,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-07 00:02:10,513 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:02:10,514 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:10,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:10,515 INFO L85 PathProgramCache]: Analyzing trace with hash -393499219, now seen corresponding path program 1 times [2024-11-07 00:02:10,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:10,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012790012] [2024-11-07 00:02:10,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:10,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:11,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:02:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:11,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:02:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:11,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:02:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:11,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 00:02:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:11,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 00:02:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:11,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:02:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:11,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 00:02:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:11,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 00:02:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:11,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 00:02:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:11,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:02:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:11,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 00:02:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:11,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 00:02:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:11,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:02:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:11,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 00:02:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:11,240 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:02:11,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:11,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012790012] [2024-11-07 00:02:11,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012790012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:02:11,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106137437] [2024-11-07 00:02:11,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:11,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:02:11,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:02:11,247 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:02:11,259 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:02:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:11,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 00:02:11,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:02:11,613 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:02:11,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:02:11,730 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:02:11,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106137437] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:02:11,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:02:11,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2024-11-07 00:02:11,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490095124] [2024-11-07 00:02:11,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:02:11,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 00:02:11,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:11,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 00:02:11,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-07 00:02:11,731 INFO L87 Difference]: Start difference. First operand 19036 states and 24724 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) [2024-11-07 00:02:16,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:16,159 INFO L93 Difference]: Finished difference Result 38331 states and 49753 transitions. [2024-11-07 00:02:16,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 00:02:16,160 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 161 [2024-11-07 00:02:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:16,213 INFO L225 Difference]: With dead ends: 38331 [2024-11-07 00:02:16,214 INFO L226 Difference]: Without dead ends: 19499 [2024-11-07 00:02:16,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=249, Invalid=1311, Unknown=0, NotChecked=0, Total=1560 [2024-11-07 00:02:16,249 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 969 mSDsluCounter, 2861 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 3182 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:02:16,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 3182 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:02:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19499 states. [2024-11-07 00:02:19,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19499 to 19036. [2024-11-07 00:02:19,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19036 states, 14047 states have (on average 1.300491208087136) internal successors, (18268), 14178 states have internal predecessors, (18268), 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:02:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19036 states to 19036 states and 24718 transitions. [2024-11-07 00:02:19,397 INFO L78 Accepts]: Start accepts. Automaton has 19036 states and 24718 transitions. Word has length 161 [2024-11-07 00:02:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:19,398 INFO L471 AbstractCegarLoop]: Abstraction has 19036 states and 24718 transitions. [2024-11-07 00:02:19,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2024-11-07 00:02:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 19036 states and 24718 transitions. [2024-11-07 00:02:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 00:02:19,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:19,410 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:02:19,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-07 00:02:19,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:02:19,614 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:19,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:19,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1554624362, now seen corresponding path program 1 times [2024-11-07 00:02:19,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:19,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697000012] [2024-11-07 00:02:19,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:19,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:20,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:02:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:20,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:02:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:20,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 00:02:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:20,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:02:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:20,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 00:02:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:20,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 00:02:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:20,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 00:02:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:20,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 00:02:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:20,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 00:02:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:20,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 00:02:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:20,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 00:02:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:20,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 00:02:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:20,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:02:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:20,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 00:02:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:20,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 00:02:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-07 00:02:20,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:20,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697000012] [2024-11-07 00:02:20,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697000012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:02:20,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249893889] [2024-11-07 00:02:20,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:20,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:02:20,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:02:20,137 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:02:20,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-07 00:02:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:20,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-07 00:02:20,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:02:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 80 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-07 00:02:20,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:02:20,732 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-07 00:02:20,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249893889] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:02:20,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:02:20,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 9] total 23 [2024-11-07 00:02:20,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123108335] [2024-11-07 00:02:20,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:02:20,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-07 00:02:20,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:20,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-07 00:02:20,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2024-11-07 00:02:20,733 INFO L87 Difference]: Start difference. First operand 19036 states and 24718 transitions. Second operand has 23 states, 23 states have (on average 7.6521739130434785) internal successors, (176), 18 states have internal predecessors, (176), 4 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (28), 8 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-07 00:02:26,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:26,147 INFO L93 Difference]: Finished difference Result 51220 states and 66216 transitions. [2024-11-07 00:02:26,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 00:02:26,147 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.6521739130434785) internal successors, (176), 18 states have internal predecessors, (176), 4 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (28), 8 states have call predecessors, (28), 4 states have call successors, (28) Word has length 169 [2024-11-07 00:02:26,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:26,260 INFO L225 Difference]: With dead ends: 51220 [2024-11-07 00:02:26,261 INFO L226 Difference]: Without dead ends: 32294 [2024-11-07 00:02:26,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=1126, Unknown=0, NotChecked=0, Total=1332 [2024-11-07 00:02:26,296 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 882 mSDsluCounter, 2288 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 2567 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:02:26,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 2567 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:02:26,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32294 states.